BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games

Proceedings, Twentieth International Conference on Machine Learning

Volumn 1, Issue , 2003, Pages 91-98

  Conitzer, Vincent ^a   Sandholm, Thomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED LOSSES; LOSS-BOUNDED LEARNABILITY; ZERO-SUM GAMES;

APPROXIMATION THEORY; BENCHMARKING; GAME THEORY; PROBABILISTIC LOGICS; STOCHASTIC CONTROL SYSTEMS;

LEARNING SYSTEMS;

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

References (23)

1. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (1995). Gambling in a rigged casino: The adversarial multi-arm bandit problem. FOCS (pp. 322-331).
2. Banos, A. (1968). On pseudo-games. Annals of Mathematical Statistics, 39, 1932-1945.
3. Bowling, M., & Veloso, M. (2002). Multiagent learning using a variable learning rate. Artificial Intelligence, 136, 215-250.
4. Brafman, R., & Tennenholtz, M. (2000). A near optimal polynomial time algorithm for learning in certain classes of stochastic games. Artificial Intelligence, 121, 31-47.
5. Brafman, R., & Tennenholtz, M. (2002). Efficient learning equilibrium. Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS). Vancouver, Canada.
6. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the ACM, 44, 427-485.
7. Conitzer, V., & Sandholm, T. (2003). Complexity results about Nash equilibria. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI). Acapulco, Mexico. Earlier version appeared as technical report CMU-CS-02-135.
8. Foster, D. P., & Vohra, R. V. (1993). A randomization rule for selecting forecasts. Operations Research, 41, 704-709.
9. Freund, Y., & Schapire, R. E. (1999). Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29, 79-103.
10. Fudenberg, D., & Levine, D. (1998). The theory of learning in games. MIT Press.
11. Fudenberg, D., & Levine, D. K. (1995). Consistency and cautious fictitious play. Journal of Economic Dynamics and Control, 19, 1065-1089.
12. Hannan, J. (1957). Approximation to Bayes risk in repeated play. vol. Ill of Contributions to the Theory of Games, 97-139. Princeton University Press.
13. Hu, J., & Wellman, M. P. (1998). Multiagent reinforcement learning: Theoretical framework and an algorithm. International Conference on Machine Learning (pp. 242-250).
14. Jehiel, P., & Samet, D. (2001). Learning to play games in extensive form by valuation. NAJ Economics, v3nl.
15. Kalai, E., & Lehrer, E. (1993). Rational learning leads to Nash equilibrium. Econometrica, 61, 1019-1045.
16. Kearns, M., & Singh, S. (1998). Near-optimal reinforcement learning in polynomial time. International Conference on Machine Learning.
17. Littman, M., & Stone, P. (2003). A polynomial-time Nash equilibrium algorithm for repeated games. Proceedings of the ACM Conference on Electronic Commerce (ACM-EC). San Diego, CA.
18. Littman, M. L. (1994). Markov games as a framework for multi-agent reinforcement learning. International Conference on Machine Learning (pp. 157-163).
19. Luce, R. D., & Raiffa, H. (1957). Games and decisions. New York: John Wiley and Sons. Dover republication 1989.
20. Megiddo, N. (1980). On repeated games with incomplete information played by non-Baycsian players. International Journal of Game Theory, 9, 157-167.
21. Monderer, D., & Tennenholtz, M. (1997). Dynamic non-bayesian decision making. Journal of Artificial Intelligence Research, 7, 231-248.
22. Papadimitriou, C. (2001). Algorithms, games and the Internet. STOC (pp. 749-753).
23. Singh, S., Kearns, M., & Mansour, Y. (2000). Nash convergence of gradient dynamics in general-sum games. Proceedings of the Uncertainty in Artificial Intelligence Conference (UAI) (pp. 541-548). Stanford, CA.