Adaptive Adversarial Multi-Armed Bandit Approach to Two-Person Zero-Sum Markov Games

Citations

WEB OF SCIENCE

10
Citations

SCOPUS

11

초록

This technical note presents a recursive sampling-based algorithm for finite horizon two-person zero-sum Markov games (MGs) based on the Exp3 algorithm developed by Auer et al. for adaptive adversarial multi-armed bandit problems. We provide a finite-iteration bound to the equilibrium value of the induced "sample average approximation game" of a given MG and prove asymptotic convergence to the equilibrium value of the given MG. The time and space complexities of the algorithm are independent of the state space of the game.

키워드

Multi-armed banditsample average approximationsamplingtwo-person zero-sum Markov game (MG)STOCHASTIC GAMESLEARNING ALGORITHMS
제목
Adaptive Adversarial Multi-Armed Bandit Approach to Two-Person Zero-Sum Markov Games
저자
Chang, Hyeong SooHu, JiaqiaoFu, Michael C.Marcus, Steven I.
DOI
10.1109/TAC.2009.2036333
발행일
2010-02
유형
Article
저널명
IEEE Transactions on Automatic Control
55
2
페이지
463 ~ 468