Repeated games against budgeted adversaries

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Abernethy, Jacob ^a   Warmuth, Manfred K ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; COST-SENSITIVE; DIVERSE APPLICATIONS; GENERAL CLASS; MINIMAX STRATEGY; MIXED STRATEGY; NORMAL FORM GAMES; REPEATED GAMES; SEQUENCE OF ACTIONS; ZERO-SUM GAME;

BUDGET CONTROL;

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

References (14)

1. J. Abernethy, M. K. Warmuth, and J. Yellin. Optimal strategies from random walks. In Proceedings of the 21st Annual Conference on Learning Theory (COLT 08), pages 437-445, July 2008.
2. Nikhil Bansal, Niv Buchbinder, and Joseph (Seffi) Naor. A Primal-Dual randomized algorithm for weighted paging. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 507-517. IEEE Computer Society, 2007.
3. Y. Bartal, A. Blum, C. Burch, and A. Tomkins. A polylog (n)-competitive algorithm for metrical task systems. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, page 711719, 1997.
4. A. Borodin, N. Linial, and M. E Saks. An optimal on-line algorithm for metrical task system. Journal of the ACM (JACM), 39(4):745763, 1992.
5. B. Brügmann. Monte carlo go. Master's Thesis, Unpublished, 1993.
6. Y. Chen, L. Fortnow, N. Lambert, D. M Pennock, and J. Wortman. Complexity of combinatorial market makers. In Proceedings of the ACM Conference on Electronic Commerce (EC), 2008.
7. Y. Chen and D. M Pennock. A utility framework for bounded-loss market makers. In Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, page 4956, 2007.
8. Y. Chen and J.WVaughan. A new understanding of prediction markets via No-Regret learning. Arxiv preprint arXiv:1003.0034, 2010.
9. A. Fiat and M. Mendel. Better algorithms for unfair metrical task systems and applications. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, page 725734, 2000.
10. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to Boosting. J. Comput. Syst. Sci., 55(1):119-139, 1997. Special Issue for EuroCOLT '95.
11. S. Gelly and D. Silver. Combining online and offline knowledge in UCT. In Proceedings of the 24th international conference on Machine learning, page 280, 2007.
12. S. Gelly, Y. Wang, R. Munos, and O. Teytaud. Modification of UCT with patterns in Monte- Carlo go. 2006.
13. R. Hanson. Combinatorial information market design. Information Systems Frontiers, 5(1):107119, 2003.
14. N. Littlestone and M. K. Warmuth. The Weighted Majority algorithm. Inform. Comput., 108(2):212-261, 1994. Preliminary version in FOCS 89.