Extending Finite Memory Determinacy to Multiplayer Games

Autor:	Roux, Stéphane Le, Pauly, Arno
Rok vydání:	2016
Předmět:	Computer Science - Computer Science and Game Theory Computer Science - Logic in Computer Science I.2.2
Zdroj:	EPTCS 218, 2016, pp. 27-40
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.218.3
Popis:	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. Comment: In Proceedings SR 2016, arXiv:1607.02694
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1607.03356 Zobrazit plný text záznamu View this record from Arxiv