2016/02/29 by Stéphane Le Roux, Roux, Stéphane Le, Arno Pauly +1
Decision Sciences · Economics, Econometrics and Finance · #68Q45 #91A06 #91A43 #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems #Logic in Computer Science (cs.LO)
paper · pdf · doi:10.48550/arxiv.1602.08912
openalex publication_date 2016/02/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. We provide a number of example that separate the various criteria we explore. Our proofs are generally constructive, that is, provide upper bounds for the memory required, as well as algorithms to compute the relevant Nash equilibria.