An Efficient Optimal-Equilibrium Algorithm for Two-Player Game Trees
Abstract
Two-player complete-information game trees are perhaps the simplest possible setting for studying general-sum games and the computational problem of finding equilibria. These games admit a simple bottom-up algorithm for finding subgame perfect Nash equilibria efficiently. However, such an algorithm can fail to identify optimal equilibria, such as those that maximize social welfare. The reason is that, counterintuitively, probabilistic action choices are sometimes needed to achieve maximum payoffs. We provide a novel polynomial-time algorithm for this problem that explicitly reasons about stochastic decisions and demonstrate its use in an example card game.
Cite
Text
Littman et al. "An Efficient Optimal-Equilibrium Algorithm for Two-Player Game Trees." Conference on Uncertainty in Artificial Intelligence, 2006.Markdown
[Littman et al. "An Efficient Optimal-Equilibrium Algorithm for Two-Player Game Trees." Conference on Uncertainty in Artificial Intelligence, 2006.](https://mlanthology.org/uai/2006/littman2006uai-efficient/)BibTeX
@inproceedings{littman2006uai-efficient,
title = {{An Efficient Optimal-Equilibrium Algorithm for Two-Player Game Trees}},
author = {Littman, Michael L. and Ravi, Nishkam and Talwar, Arjun and Zinkevich, Martin},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2006},
url = {https://mlanthology.org/uai/2006/littman2006uai-efficient/}
}