Combining Local Search Techniques and Path Following for Bimatrix Games
Abstract
Computing a Nash equilibrium (NE) is a central task in computer science. An NE is a particularly appropriate solution concept for two-agent settings because coalitional deviations are not an issue. However, even in this case, finding an NE is PPAD-complete. In this paper, we combine path following algorithms with local search techniques to design new algorithms for finding exact and approximate NEs. We show that our algorithms largely outperform the state of the art and that almost all the known benchmark game classes are easily solvable or approximable (except for the GAMUT CovariantGame-Rand class).
Cite
Text
Gatti et al. "Combining Local Search Techniques and Path Following for Bimatrix Games." Conference on Uncertainty in Artificial Intelligence, 2012.Markdown
[Gatti et al. "Combining Local Search Techniques and Path Following for Bimatrix Games." Conference on Uncertainty in Artificial Intelligence, 2012.](https://mlanthology.org/uai/2012/gatti2012uai-combining/)BibTeX
@inproceedings{gatti2012uai-combining,
title = {{Combining Local Search Techniques and Path Following for Bimatrix Games}},
author = {Gatti, Nicola and Patrini, Giorgio and Rocco, Marco and Sandholm, Tuomas},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2012},
pages = {286-295},
url = {https://mlanthology.org/uai/2012/gatti2012uai-combining/}
}