Regret in the On-Line Decision Problem

Games and Economic Behavior

Volumn 29, Issue 1, 1999, Pages 7-35

  Foster, Dean P ^a   Vohra, Rakesh ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002476325     PISSN: 08998256     EISSN: None     Source Type: Journal    
DOI: 10.1006/game.1999.0740     Document Type: Article

References (29)

1. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. (1995), "Gambling in a Rigged Casino: The Adversarial Multi-Armed Bandit Problem," in 36th Annual IEEE Symposium on Foundations of Computer Science, November.
2. Banos, A. (1968), "On pseudo-games," Ann. Math. Statist. 39, 1932-1945.
3. Blackwell, D. (1956a), "Controlled Random Walks," invited address, Institute of Mathematical Statistics Meeting, Seattle, WA.
4. Blackwell, D. (1956b), "An Analog of the Minimax Theorem for Vector Payoffs," Pacific J. Math. 6, 1-8.
5. Cesa-Bianchi, N., Freund, Y., Helmbold, D., and Haussler, D. (1993), "How to Use Expert Advice," in Proceedings of the 25th ACM Symposium on the Theory of Computing, pp. 382-291.
6. Chung, T. H. (1994), "Approximate Methods for Sequential Decision Making Using Expert Advice," in Proceedings of the 7th Annual ACM Conference on Computational Learning Theory, pp. 183-189.
7. Cover, T. (1991), "Universal Portfolios," Math. Finance 1-29.
8. DeSantis, A., Markowski, G., and Wegman, M. (1992), "Learning Probabilistic Prediction Functions," in Proceedings of the 1988 Workshop of Computational Learning Theory, pp. 312-328.
9. Easley, D., and Rustichini, A. (1995), "Choice Without Beliefs," unpublished manuscript.
10. Feder, M., Mehrav, N., and Gutman, M. (1992), "Universal Prediction of Individual Sequences," IEEE Trans. Inform. Theory 38, 1258-1270.
11. Foster, D. (1991), "Prediction in the Worst-Case," Ann. Statist. 19, 1084-1090.
12. Foster, D., and Vohra, R. (1993), "A Randomized Rule for Selecting Forecasts," Oper. Res. 41, 704-707.
13. Foster, D., and Vohra, R. (1998), "Asymptotic Calibration," Biometrika 85, No. 2, 379-390.
14. Foster, D. and Vohra, R. (1997), "Calibrated Learning and Correlated Equilibrium," Games Econ. Behavior 21, 40-55.
15. Freund, Y., and Schapire, R. (1995), "A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting," in Proceedings of the Second European Conference on Computational Learning Theory.
16. Freund, Y., and Schapire, R. (1996), "Game Theory, On-line Prediction and Boosting," unpublished manuscript.
17. Fudenberg, D., and Levine, D. (1995), "Universal consistency and cautious fictitious play," J. Econom. Dyn. Control 19, 1065-1089.
18. Fudenberg, D., and Levine, D. (1999a), "An Easier Way to Calibrate," Games Econ. Behavior 29, 131-137.
19. Fudenberg, D., and Levine, D. (1999b), "Universal Conditional Consistency," Games Econ. Behavior 29, 104-130.
20. Hanan, J. (1957), "Approximation to Bayes Risk in Repeated Plays," in Contributions to the Theory of Games of Games, (M. Dresher, A. W Tucker, and P. Wolfe, Eds.), Vol. 3, pp. 97-139. Princeton, NJ: Princeton Univ. Press.
21. Haussler, D., Kivinen, J., and Warmuth, M. (1995), "Tight Worst-Case Loss Bounds for Predicting with Expert Advice," in Computational Learning Theory: Second European Conference, EUROCOLT '95, pp. 69-83. Berlin/New York: Springer-Verlag.
22. Hart, S., and Mas-Colell, A. (1996), "A Simple Adaptive Procedure Leading to Correlated Equilibrium," unpublished manuscript.
23. Irani, S., and Karlin, A. (1996), "On-Line Computation," in Approximation Algorithms for NP-Hard Problems (Dorit Hochbaum, Ed.), Boston: PWS-Kent.
24. Kivinen, J., and Warmuth, M. (1993), "Using Experts for Predicting Continuous Outcomes," in Computational Learning Theory: EURO COLT '93, pp. 109-120. Berlin/New York: Springer-Verlag.
25. Lehrer, E. (1997), "Approachability in Infinite Dimensional Spaces and an Application: A Universal Algorithm for Generating Extended Normal Numbers," unpublished manuscript.
26. Littlestone, N., and Warmuth, M. (1994), "The Weighted Majority Algorithm," Inform. and Comput. 108, 212-261. [Also appeared in the 30th FOCS conference, 1989.]
27. Megiddo, N. (1980), "On Repeated Games with Incomplete Information Played by Non-Bayesian Players," Internat. J. Game Theory 9, 157-167.
28. Vovk, V. (1990), "Aggregating Strategies," in Proceedings of the 3rd Annual Conference on Computational Learning Theory, pp. 371-383.
29. Vielle, N. (1992), "Weak Approachability," Math. Oper. Res. 17, 781-791.