Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
97
Voted
APPROX
2004
Springer
110
views
Algorithms
»
more
APPROX 2004
»
Convergence Issues in Competitive Games
15 years 8 months ago
Download
www.kellogg.northwestern.edu
Vahab S. Mirrokni, Adrian Vetta
Real-time Traffic
Algorithms
|
APPROX 2004
|
claim paper
Related Content
»
On the convergence of regret minimization dynamics in concave games
»
General Game Playing Overview of the AAAI Competition
»
Beyond myopic best response in Cournot competition
»
Congestion Games Optimization in Competition
»
Competitive Routing over Time
»
The Design and Implementation of a Successful General Game Playing Agent
»
Competitive Design of Multiuser MIMO Systems based on Game Theory A Unified View
»
Designing Storytelling Games That Encourage Narrative Play
»
Competition and Coordination in Stochastic Games
more »
Post Info
More Details (n/a)
Added
30 Jun 2010
Updated
30 Jun 2010
Type
Conference
Year
2004
Where
APPROX
Authors
Vahab S. Mirrokni, Adrian Vetta
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision