Adaptive strategies and regret minimization in arbitrarily varying Markov environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2111, Issue , 2001, Pages 128-142

  Mannor, Shie ^a   Shimkin, Nahum ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

ADAPTIVE STRATEGY; ATTAINABLE SOLUTIONS; CONTROL STRATEGIES; GUARANTEED PERFORMANCE; MARKOVIAN DYNAMICS; REGRET MINIMIZATION; SINGLE CONTROLLERS; STATE TRANSITIONS;

COMPUTATION THEORY;

EID: 84943237201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44581-1_9     Document Type: Conference Paper

References (22)

1. Special issue on learning in games. Games and Economic Behavior, 29(1), November 1999.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: The adversarial multi armed bandit problem. In Proc. 36th Annual Symposium on Foundations of Computer Science, pages 322–331. IEEE Computer Society Press, 1995.
3. D.P. Bertsekas and J.N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1995.
4. D. Blackwell. An analog of the minimax theorem for vector payoffs. Pacific J. Math., 6(1):1–8, 1956.
5. D. Blackwell. Controlled random walks. In Proc. International Congress of Mathematicians, 1954, volume 3, pages 336–338. North-Holland, 1956.
6. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer Verlag, 1996.
7. Y. Freund and R. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29:79–103, November 1999.
8. D. Fudenberg and D. Levine. Universal consistency and cautious fictitious play. Journal of Economic Dynamic and Control, 19:1065–1990, 1995.
9. J. Hannan. Approximation to bayes risk in repeated play. In M. Dresher, A. W. Tucker, and P. Wolde, editors, Contribution to The Theory of Games, III, pages 97–139. Princeton University Press, 1957.
10. S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. DP 166, The Hebrew University of Jerusalem, Center for Rationality, 1998.
11. E. Lehrer. Approachability in infinite dimensional spaces and an application: A universal algorithm for generating extended normal numbers. Preprint, May 1998.
12. M.L. Littman. Markov games as a framework for multi-agent reinforcement learning. In Morgan Kaufman, editor, Eleventh International Conference on Machine Learning, pages 157–163, 1994.
13. S. Mannor and N. Shimkin. The empirical bayes envelope approach to regret minimization in stochastic games. Technical report EE- 1262, Faculty of Electrical Engineering, Technion, Israel, October 2000. available from: http://tiger.technion.ac.il/~shie/Public/drmOct23techreport.ps.gz.
14. S. Mannor and N. Shimkin. Regret minimization in signal space for repeated matrix games with partial observations. Technical report EE- 1242, Faculty of Electrical Engineering, Technion, Israel, March 2000. available from: http://tiger.technion.ac.il/~shie/Public/beMar16.ps.gz.
15. T. Parthasarathy and M. Stern. Markov games - a survey. Differential Games and Control Theory, 1977.
16. S.D. Patek. Stochastic Shortest Path Games. PhD thesis, LIDS MIT, January 1997.
17. M. Puterman. Markov Decision Processes. Wiley-Interscience, 1994.
18. E. Rasmunsen. Games and Information: An Introduction to Game Theory. Blackwell, 1994.
19. A. Rustichini. Minimizing regret: the general case. Games and Economic Behavior, 29:224–243, November 1999.
20. N. Shimkin and A. Shwartz. Guaranteed performance regions in markovian systems with competing decision makers. IEEE Trans. on Automatic Control, 38(1):84–95, January 1993.
21. X. Spiant. An approachability condition for general sets. Technical Report 496, Ecole Polytechnique, Paris, 1999.
22. V. Vovk. A game of prediction with experts advice. Journal of Computer and Systems Sciences, 56(2):153–173, April 1998.