On-line learning with imperfect monitoring

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 552-566

  Mannor, Shie ^a   Shimkin, Nahum ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; ONLINE SYSTEMS; OPTIMIZATION; SET THEORY; SIGNALING; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; COMPUTERS;

IMPERFECT MONITORING; MATRIX GAMES; ON-LINE LEARNING; SIGNALING STRUCTURE; AVERAGE REWARD; MATRIX GAME; ONLINE LEARNING; PARTIAL OBSERVATION; SOLUTION CONCEPTS;

EDUCATION COMPUTING; STOCHASTIC SYSTEMS;

EID: 9444255069     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_40     Document Type: Conference Paper

References (12)

1. D. Fudenberg and D. Levine. Universal consistency and cautious fictitious play. Journal of Economic Dynamic and Control, 19:1065-1190, 1995.
2. 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.
3. D. Blackwell. Controlled random walks. In Proc. International Congress of Mathematicians, 1954, volume III, pages 336-338. North-Holland, 1956.
4. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The non-stochastic multiarmed bandit problem. To appear in SIAM journal of Computation, 2002.
5. A. Rustichini. Minimizing regret: the general case. Games and Economic Behavior, 29:224-243, November 1999.
6. A. Piccolboni and C. Schindelhauer. Discrete prediction games with arbitrary feedback and loss. In D. Helmbold and B. Williamson, editors, Fourteenth Annual Conference on Computation Learning Theory, pages 208-223. Springer, 2001.
7. D. Blackwell. An analog of the minimax theorem for vector payoffs. Pacific J. Math., 6(1):1-8, 1956.
8. R.T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
9. K. Ramakrishnan, S. Floyd, and D. Black. The addition of explicit congestion notification (ECN) to IP. IETF, Tech. Rep., 2001.
10. 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://web.mit.edu/~shie/www/pubs.htm.
11. N. Shimkin. Extremal large deviations in controlled I.I.D. processes with applications to hypothesis testing. Adv. Appl. Prob., 25:875-894, 1993.
12. D.P. Bertsekas and J.N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996.