Efficient no-regret multiagent learning

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 41-46

  Banerjee, Bikramjit ^a   Peng, Jing ^a  

^a Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME MATRICES; POLYNOMIAL BOUNDS; STOCHASTIC SAMPLING;

MATRIX ALGEBRA; MULTI AGENT SYSTEMS; OPTIMIZATION; POLYNOMIALS; STATISTICAL METHODS;

LEARNING SYSTEMS;

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

References (20)

1. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 1998. Gambling in a rigged casino: The adversarial multi-armed bandit problem. Technical Report NC2-TR-1998-025, NeuroCOLT2 Technical Report Series.
2. Banerjee, B., and Peng, J. 2004. Performance bounded reinforcement learning in strategic interactions. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), 2-7. San Jose, CA: AAAI Press.
3. Bowling, M., and Veloso, M. 2002. Multiagent learning using a variable learning rate. Artificial Intelligence 136:215-250.
4. Bowling, M. 2005. Convergence and no-regret in multiagent learning. In Proceedings of NIPS 2004/5.
5. Claus, C., and Boutilier, C. 1998. The dynamics of reinforcement learning in cooperative multiagent systems. In Proceedings of the 15th National Conference on Artificial Intelligence, 746-752. Menlo Park, CA: AAAI Press/MIT Press.
6. Conitzer, V., and Sandholm, T. 2003. AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents. In Proceedings of the 20th International Conference on Machine Learning.
7. Flaxman. A.; Kalai, A.; and McMahan, H. 2005. Online convex optimization in the bandit setting: Gradient descent without a gradient. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). To appear.
8. Freund, Y., and Schapire. R. E. 1999. Adaptive game playing using multiplicative weights. Games and Economic Behavior 29:79 -103.
9. Fudenberg, D., and Levine, D. 1995. Consistency and cautious fictitious play. Journal of Economic Dynamics and Control 19:1065-1089.
10. Greenwald, A., and Hall, K. 2002. Correlated q-learning. In Proceedings of the AAAI Symposium on Collaborative Learning Agents.
11. Hu, J., and Wellman, M. P. 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm. In Proc. of the 15th Int. Conf. on Machine Learning (ML'98), 242-250. San Francisco. CA: Morgan Kaufmann.
12. Jafari, A.; Greenwald, A.; Gondek, D.; and Ercal, G. 2001. On no-regret learning, fictitious play, and nash equilibrium. In Proceedings of the Eighteenth International Conference on Machine Learning, 226-223.
13. Littlestone, N., and Warmuth, M. 1994. The weighted majority algorithm. Information and Computation 108:212-261.
14. Littman, M. L. 1994. Markov games as a framework for multiagent reinforcement learning. In Proc. of the 11th Int. Conf. on Machine Learning, 157-163. San Mateo, CA: Morgan Kaufmann.
15. Littman, M. L. 2001. Friend-or-foe Q-learning in general-sum games. In Proceedings of the Eighteenth International Conference on Machine Learnig.
16. Powers. R., and Shoham, Y. 2005. New criteria and a new algorithm for learning in multi-agent systems. In Proceedings of NIPS 2004/5.
17. Singh, S.; Kearns, M.; and Mansour, Y. 2000. Nash convergence of gradient dynamics in general-sum games. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, 541-548.
18. Sutton, R., and Burto, A. G. 1998. Reinforcement Learning: An Introduction. MIT Press.
19. Wang, X., and Sandholm, T. 2002. Reinforcement learning to play an optimal nash equilibrium in team markov games. In Advances in Neural Information Processing Systems 15, NIPS.
20. Zinkevich, M. 2003. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning.