Fast and compact: A simple class of congestion games

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 489-494

  Ieong, Samuel ^a   McGrew, Robert ^a   Nudelman, Eugene ^a   Shoham, Yoav ^a   Sun, Qixiang ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION GAMES; NASH EQUILIBRIUM; SINGLETON GAMES;

GAME THEORY; POLYNOMIALS;

ARTIFICIAL INTELLIGENCE;

EID: 29344462605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Anshelevich, E.; Dasgupta, A.; Kleinburg, J.; Tardos, E.; Wexler, T.; and Roughgarden, T. 2004. The price of stability for network design with fair cost allocation. In FOCS04, 295-304.
2. Bhat, N. A. R., and Leyton-Brown, K. 2004. Computing Nash equlibria of action-graph games. In Proc. UAI-2004.
3. Conitzer, V., and Sandholm, T. 2003. Complexity results about Nash equilibria. In Proc. IJCAI-2003, 765-771.
4. Even-Dar, E.; Kesselman, A.; and Mansour, Y. 2003. Convergence time to nash equilibria. In ICALP2003, 502-513.
5. Fabrikant, A.; Papadimitriou, C. H.; and Talwar, K. 2004. The complexity of pure Nash equilibria. In Proc. STOC-2004, 604-612.
6. Holzman, R., and Law-Yone, N. 1997. Strong equilibrium in congestion games. Games and Economic Behavior 21:85-101.
7. Kearns, M; Littman, M.; and Singh, S. 2001. Graphical models for game theory. In Proc. UAI-2001.
8. Koller, D., and Milch, B. 2001. Multi-agent influence diagrams for representing and solving game. In IJCAI-2001.
9. Leyton-Brown, K., and Tennenholtz, M. 2003. Local-effect games. In Proc. IJCAI-2003.
10. Milchtaich, I. 1996, Congestion games with player-specific pay-off functions. Games and Economic Behavior 13:111-124.
11. Osborne, M. J., and Rubinstein, A. 1994. A Course in Game Theory. Cambridge, Massachusetts: The MIT Press.
12. Papadimitriou, C. 2001. Algorithms, games, and the internet. In Proc. STOC-2001, 749-753.
13. Porter, R.; Nudelman, E.: and Shoham, Y. 2004. Simple search methods for finding a Nash equilibrium. In Proc. AAAI-2003.
14. Rosenthal, R. 1973. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2:65-67.
15. Voorneveld, M.; Borm, P.; van Megan Freek; Tijs, S.; and Facchini, G. 1999. Congestion games and potentials reconsidered. International Game Theory Review 1:283-299.