Online Sparse Bandit for Card Games


Finding an approximation of a Nash equilibria in matrix games is an important topic that reaches beyond the strict application to matrix games. A bandit algorithm commonly used to approximate a Nash equilibrium is EXP3 [3]. However, the solution to many problems is often sparse, yet EXP3 inherently fails to exploit this property. To the knowledge of the… (More)
DOI: 10.1007/978-3-642-31866-5_25


3 Figures and Tables

Cite this paper

@inproceedings{StPierre2011OnlineSB, title={Online Sparse Bandit for Card Games}, author={David Lupien St-Pierre and Quentin Louveaux and Olivier Teytaud}, booktitle={ACG}, year={2011} }