Hedged learning: Regret-minimization with learning experts

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 121-128

  Chang, Yu Han ^a   Kaelbling, Leslie Pack ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; LEARNING ALGORITHMS; MATHEMATICAL MODELS; MULTI AGENT SYSTEMS; OPTIMIZATION;

INDEPENDENT LEARNING ALGORITHMS; MULTI-AGENT LEARNING; REGRET-MINIMIZATION;

LEARNING SYSTEMS;

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

References (10)

1. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (1995). Gambling in a rigged casino: the adversarial multi-armed bandit problem. Proceedings of the 36th Symposium on Foundations of Computer Science.
2. Chang, Y., & Kaelbling, L. P. (2001). Playing is believing: The role of beliefs in multi-agent learning. NIPS.
3. de Farias, D. P., & Meggido, N. (2004). How to combine expert (or novice) advice when actions impact the environment. Proceedings of NIPS.
4. Freund, Y., & Schapire, R. E. (1999). Adaptive game playing using multiplicative weights. Games and Economic Behavior, 89, 79-103.
5. Fudenburg, D., & Levine, D. K. (1995). Consistency and cautious fictitious play. Journal of Economic Dynamics and Control, 19, 1065-1089.
6. Hu, J., & Wellman, M. P. (1998). Multiagent reinforcement learning: Theoretical framework and an algorithm. Proceedings of the 15th ICML.
7. Kearns, M., & Singh, S. (1998). Near-optimal reinforcement learning in polynomial time. ICML.
8. Littman, M. L. (1994). Markov games as a framework for multi-agent reinforcement learning. ICML.
9. Mannor, S., & Shimkin, N. (2001), Adaptive strategies and regret minimization in arbitrarily varying Markov environments. Proc. of 14th COLT.
10. Nachbar, J., & Zame, W. (1996). Non-computable strategies and discounted repeated games. Economic Theory.