Convergence issues in competitive games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 183-194

  Mirrokni, Vahab S ^a   Vetta, Adrian ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMMERCE; DECISION THEORY; GAME THEORY; ITERATIVE METHODS; OPTIMIZATION;

APPROXIMATE SOLUTION; COMPETITIVE GAMES; CONVERGENCE ISSUES; NASH EQUILIBRIA; NONCOOPERATIVE GAME; RESPONSE BEHAVIOR; SOCIAL UTILITY FUNCTIONS; SPEED OF CONVERGENCE;

TELECOMMUNICATION NETWORKS;

EID: 35048830858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_17     Document Type: Article

References (13)

1. P. Brucker, J. Hurink, and F. Werner. "Improving local search heuristics for some scheduling problems", Discrete Applied Mathematics, 72, pp47-69, 1997.
2. E. Even-dar, A. Kesselman, and Y. Mansour. "Convergence time to Nash equilibria", ICALP, 2003.
3. A. Fabrikant, C. Papadimitriou, and K. Talwar. "On the complexity of pure equilibria", STOC, 2004.
4. M. Goemans, L. Li, V.S.Mirrokni, and M. Thottan. "Market sharing games applied to content distribution in ad-hoc networks", MOBIHOC, 2004.
5. I. Milchtaich. "Congestion games with player-specific payoff functions", Games and Economic Behavior, 13(1), pp111-124, 1996.
6. D. Monderer and L. Shapley. "Potential games", Games and Economic Behavior, 14(1), pp124-143, 1996.
7. N. Nisan and A. Ronen. "Algorithmic mechanism design", Games and Economic Behavior, 35(1-2), pp166-196, 2001.
8. C. Papadimitriou. "Algorithms, games, and the internet", STOC, 2001.
9. R. W. Rosenthal. "A class of games possessing pure-strategy Nash equilibria", International Journal of Game Theory, 2, pp65-67, 1973.
10. T. Roughgarden and E. Tardos. "Bounding the inefficiency of equilibria in nonatomic congestion games", Games and Economic Behavior, 47(2), pp389-403, 2004.
11. T. Roughgarden and E. Tardos. "How bad is selfish routing?", J. ACM, 49(2), pp236-259, 2002.
12. P. Schuurman and T. Vredeveld. "Performance guarantees of local search for multiprocessor scheduling", IPCO, 2001.
13. A. Vetta. "Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions", FOCS, 2002.