Extending Finite Memory Determinacy to Multiplayer Games

Stéphane Le Roux
(Université Libre de Bruxelles)
Arno Pauly
(Université Libre de Bruxelles)

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding class of multi-player multi-outcome games. This generalizes a previous result by Brihaye, De Pril and Schewe. For most of our conditions we provide counterexamples showing that they cannot be dispensed with.

Our proofs are generally constructive, that is, provide upper bounds for the memory required, as well as algorithms to compute the relevant winning strategies.

In Alessio Lomuscio and Moshe Y. Vardi: Proceedings of the 4th International Workshop on Strategic Reasoning (SR 2016), New York City, USA, 10th July 2016, Electronic Proceedings in Theoretical Computer Science 218, pp. 27–40.
Published: 10th July 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.218.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org