Adaptive Game Playing Using Multiplicative Weights

Games and Economic Behavior

Volumn 29, Issue 1, 1999, Pages 79-103

  Freund, Yoav ^a   Schapire, Robert E ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (32)

1. Angluin, D., and Valiant, L. G. (1979). "Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings," J. Comput. Syst. Sci. 18, No. 2, 155-193.
2. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. (1995). "Gambling in a Rigged Casino: The Adversarial Multi-Armed Bandit Problem," in Thirty-Sixth Annual Symposium on Foundations of Computer Science, pp. 322-331.
3. Blackwell, D. (1956). "An Analog of the Minimax Theorem for Vector Payoffs. Pacific J. Math. 6, No. 1, 1-8.
4. Blackwell, D. and Girshick, M. A. (1954). Theory of Games and Statistical Decisions. New York: Dover.
5. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., and Warmuth, M. K. (1997). "How to Use Expert Advice," J. Assoc. Comput. Mach., 44, No. 3, 427-485.
6. Cover, T. M. (1991). "Universal Portfolios." Math. Finance 1, No. 1, 1-29.
7. Cover, T. M., and Ordentlich, E. (1996). "Universal Portfolios with Side Information," IEEE Trans. Inform. Theory.
8. Cover, T. M., and Thomas, J. A. (1991). Elements of Information Theory. New York: Wiley.
9. Dawid, A. P. (1984). "Statistical Theory: The Prequential Approach," J. Roy. Statist. Soc., Ser. A 147, 278-292.
10. Feder, M., Merhav, N., and Gutman, M. (1992). "Universal Prediction of Individual Sequences," IEEE Trans. Inform. Theory 38, 1258-1270.
11. Ferguson, T. S. (1967). Mathematical Statistics: A Decision Theoretic Approach. San Diego: Academic Press.
12. Foster, D. P. (1991). "Prediction in the Worst Case," Ann. Statist. 19, No. 2, 1084-1090.
13. Foster, D. P., and Vohra, R. V. (1993). "A Randomization Rule for Selecting Forecasts," Oper. Res. 41, No. 4, 704-709.
14. Foster, D. P., and Vohra, R. V. (1998). "Asymptotic Calibration," Biometrika 85, No. 2, 379-390.
15. Foster, D. P., and Vohra, R. (1999). "Regret in the On-Line Decision Problem," Games Econ. Behavior, 29, 7-35.
16. Freund, Y., and Schapire, R. E. (1996). "Game Theory, On-Line Prediction and Boosting," in Proceedings of the Ninth Annual Conference on Computational Learning Theory, pp. 325-332.
17. Fudenberg, D., and Levine, D. K. (1995). "Consistency and Cautious Fictitious Play," J. Econ. Dynam. Control 19, 1065-1089.
18. Grigoriadis, M. D., and Khachiyan, L. G. (1991). "Approximate Solution of Matrix Games in Parallel," Technical Report 91-73, DIMACS.
19. Grigoriadis, M. D., and Khachiyan, L. G. (1995). "A Sublinear-Time Randomized Approximation Algorithm for Matrix Games," Oper. Res. Lett. 18, No. 2, 53-58.
20. Hannan, J. (1957). "Approximation to Bayes Risk in Repeated Play," in Contributions to the Theory of Games (M. Dresher, A. W. Tucker, and P. Wolfe, Eds.), Vol. 3, pp. 97-139. Princeton: Princeton Univ. Press.
21. Helmbold, D. P., Schapire, R. E., Singer, Y., and Warmuth, M. K. (1998). "On-Line Portfolio Selection Using Multiplicative Updates," Math. Finance 8, No. 4, 325-347.
22. Hoeffding, W. (1963). "Probability Inequalities for Sums of Bounded Random Variables," J. Amer. Statist. Assoc. 58, No. 301, 13-30.
23. Kivinen, J., and Warmuth, M. K. (1997). "Additive Versus Exponentiated Gradient Updates for Linear Prediction," Inform. Comput. 132, No. 1, 1-64.
24. Klein, P., and Young, N. (1999). "On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms" in Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization.
25. Littlestone, N., and Warmuth, M. K. (1994). "The Weighted Majority Algorithm," Inform. Comput. 108, 212-261.
26. Owen, G. (1982). Game Theory. 2nd ed., San Diego: Academic Press.
27. Plotkin, S. A., Shmoys, D. B., and Tardos, É. (1995). "Fast Approximation Algorithms for Fractional Packing and Covering Problems," Math. Oper. Res. 20, No. 2, 257-301.
28. Shtar'kov, Y. M. (1987). "Universal Sequential Coding of Single Messages," Prob. Inform. Transmission 23, 175-186, (translated from Russian).
29. Vovk, V. G. (1990). "Aggregating Strategies," in Proceedings of the Third Annual Workshop on Computational Learning Theory, pp. 371-383.
30. Vovk, V. G. (1998). "A Game of Prediction with Expert Advice," J. Comput. Syst. Sci. 56, No. 2, 153-173.
31. Young, N. (1995). "Randomized Rounding without Solving the Linear Program," in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 170-178.
32. Ziv, J. (1998). "Coding Theorems for Individual Sequences," IEEE Trans. Inform. Theory 24, No. 4, 405-412.