Safe opponent exploitation

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2012, Pages 587-604

  Ganzfried, Samuel ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

game theory; multiagent learning; opponent exploitation

Indexed keywords

BEST RESPONSE; EQUILIBRIUM STRATEGY; GAME-THEORETIC; MULTI-AGENT LEARNING; OPPONENT EXPLOITATION; TEST PROBLEM; TIME STEP; ZERO-SUM GAME;

ELECTRONIC COMMERCE; GAME THEORY; ITERATIVE METHODS; MULTI AGENT SYSTEMS; PROFITABILITY;

ALGORITHMS;

EID: 84863535666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2229012.2229056     Document Type: Conference Paper

References (17)

1. AUER, P., CESA-BIANCHI, N., FREUND, Y., AND SCHAPIRE, R. E. 2002. The nonstochastic multiarmed bandit problem. SIAM Journal of Computing 32.
2. BOWLING, M., JOHANSON, M., BURCH, N., AND SZAFRON, D. 2008. Strategy evaluation in extensive games with importance sampling. ICML.
3. GANZFRIED, S. AND SANDHOLM, T. 2010. Computing equilibria by incorporating qualitative models. AAMAS.
4. GANZFRIED, S. AND SANDHOLM, T. 2011. Game theory-based opponent modeling in large imperfect-information games. AAMAS.
5. GORDON, G. J. 2005. No-regret algorithms for structured prediction problems. Tech. Rep. CMU-CALD-05-112, Carnegie Mellon University.
6. HAWKIN, J., HOLTE, R., AND SZAFRON, D. 2011. Automated action abstraction of imperfect information extensive-form games. AAAI.
7. HODA, S., GILPIN, A., PEÑA, J., AND SANDHOLM, T. 2010. Smoothing techniques for computing Nash equilibria of sequential games. Mathematics of Operations Research 35.
8. HOEHN, B., SOUTHEY, F., HOLTE, R. C., AND BULITKO, V. 2005. Effective short-term opponent exploitation in simplified poker. AAAI.
9. JOHANSON, M., ZINKEVICH, M., AND BOWLING, M. 2007. Computing robust counterstrategies. NIPS.
10. KOLLER, D., MEGIDDO, N., AND VON STENGEL, B. 1994. Fast algorithms for finding randomized strategies in game trees. STOC.
11. KOLLER, D. AND PFEFFER, A. 1997. Representations and solutions for game-theoretic problems. Artificial Intelligence 94.
12. KUHN, H. W. 1950. Simplified two-person poker. Contributions to the Theory of Games, H. W. Kuhn and A. W. Tucker.
13. MCCRACKEN, P. AND BOWLING, M. 2004. Safe strategies for agent modelling in games. AAAI Fall Symposium on Artificial Multi-agent Learning.
14. POWERS, R., SHOHAM, Y., AND VU, T. 2007. A general criterion and an algorithmic framework for learning in multi-agent systems. Machine Learning 67.
15. SANDHOLM, T. 2007. Perspectives on multiagent learning. Artificial Intelligence 171.
16. WAUGH, K. 2009. Abstraction in large extensive games. M.S. thesis, University of Alberta.
17. ZINKEVICH, M., BOWLING, M., JOHANSON, M., AND PICCIONE, C. 2007. Regret minimization in games with incomplete information. NIPS.