Learning and solving many-player games through a cluster-based representation

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 188-196

  Ficici, Sevan G ^a   Parkes, David C ^a   Pfeffer, Avi ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMMETRIC GAMES; CLUSTER-BASED; CLUSTER-BASED METHODS; INDIVIDUAL AGENT; MODEL-FREE METHOD; REDUCED GAMES;

ARTIFICIAL INTELLIGENCE;

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

References (11)

1. W. B. Arthur. Inductive reasoning and bounded rationality. Amer. Econ. Review, 84(2):406-411, 1994.
2. N. Bhat and K. Leyton-Brown. Computing Nash equilibria of action-graph games. In UAI, 2004.
3. C. Daskalakis, A. Mehta, and C. H. Papadimitriou. Progress in approximate nash equilibria. In 8th ACM Conf. on Electronic Commerce, 2007.
4. C. Daskalakis and C. H. Papadimitriou. Computing equilibria in anonymous games. In FOCS, 2007.
5. P. Jehiel. Analogy-based expectation equilibrium. Journal of Economic Theory, 123:81-104, 2005. (Pubitemid 40864821)
6. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In UAI, 2001.
7. M. Kearns and Y. Mansour. Efficient nash computation in large population games with bounded influence. In UAI, 2002.
8. R. D. McKelvey, A. M. McLennan, and T. L. Turocy. Gambit: Software tools for game theory, version 0.2007.01.30. http://gambit.sourceforge.net, 2007.
9. J. F. Nash. Noncooperative games. Annals of Mathematics, 54:189-295, 1951.
10. Y. Vorobeychik, M. P. Wellman, and S. Singh. Learning payoff functions in infinite games. Machine Learning, 67:145-168, 2007. (Pubitemid 46571922)
11. M. P. Wellman, D. M. Reeves, K. M. Lochner, S.-F. Cheng, and R. Suri. Approximate strategic reasoning through hierarchical reduction of large symmetric games. In AAAI, 2005.