Communication complexity as a lower bound for learning in games

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 185-192

  Conitzer, Vincent ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION PROTOCOL; LEARNING COMMUNITY; PAYOFFS;

ENCODING (SYMBOLS); GAME THEORY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; RESEARCH; THEOREM PROVING;

LEARNING SYSTEMS;

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

References (20)

1. Blum, B., Shelton, C. R., & Koller, D. (2003). A continuation method for Nash equilibria in structured games. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI). Acapulco, Mexico.
2. Bowling, M., & Veloso, M. (2002). Multiagent learning using a variable learning rate. Artificial Intelligence, 136, 215-250.
3. Conitzer, V., & Sandholm, T. (2003). AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents. International Conference on Machine Learning (pp. 83-90).
4. Freund, Y., & Schapire, R. E. (1999). Adaptive game playing using multiplicative weights. Games & Econ. Behavior, 29, 79-103.
5. Fudenberg, D., & Levine, D. (1998). The theory of learning in games. MIT Press.
6. Gilboa, I., Kalai, E., & Zemel, E. (1993). The complexity of eliminating dominated strategies. Mathematics of Operation Research, 18, 553-565.
7. Greenwald, A., & Hall, K. (2003). Correlated Q-learning. International Conference on Machine Learning (pp. 242-249).
8. Hannan, J. (1957). Approximation to Bayes risk in repeated play, vol. III of Contributions to the Theory of Games, 97-139.
9. Hu, J., & Wellman, M. P. (1998). Multiagent reinforcement learning: Theoretical framework and an algorithm. International Conference on Machine Learning (pp. 242-250).
10. Kearns, M., Littman, M., & Singh, S. (2001). Graphical models for game theory. Conference on Uncertainty in Artificial Intelligence (UAI).
11. Kushilevitz, E., & Nisan, N. (1997). Communication complexity. Cambridge University Press.
12. Leyton-Brown, K., & Tennenholtz, M. (2003). Local-effect games. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI). Acapulco, Mexico.
13. Littman, M., & Stone, P. (2003). A polynomial-time Nash equilibrium algorithm for repeated games. Proceedings of the ACM Conference on Electronic Commerce (ACM-EC) (pp. 48-54).
14. Littman, M. L. (1994). Markov games as a framework for multi-agent reinforcement learning. International Conference on Machine Learning (pp. 157-163).
15. Papadimitriou, C. (2001). Algorithms, games and the Internet. STOC (pp. 749-753).
16. Singh, S., Kearns, M., & Mansour, Y. (2000). Nash convergence of gradient dynamics in general-sum games. Conference on Uncertainty in Artificial Intelligence (UAI) (pp. 541-548).
17. Stimpson, J., & Goodrich, M. (2003). Learning to cooperate in a social dilemma: A satisficing approach to bargaining. International Conference on Machine Learning (pp. 728-735).
18. Tan, M. (1993). Multi-agent reinforcement learning: Independent vs. cooperative agents. International Conference on Machine Learning (pp. 330-337).
19. Wang, X., & Sandholm, T. (2002). Reinforcement learning to play an optimal Nash equilibrium in team Markov games. Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS). Vancouver, Canada.
20. Yao, A. C. (1979). Some complexity questions related to distributed computing. Proceedings of the 11th ACM symposium on theory of computing (STOC) (pp. 209-213).