No Cover Image

Journal article 259 views 25 downloads

Extending finite-memory determinacy to multi-player games / Stéphane Le Roux; Arno Pauly

Information and Computation

Swansea University Author: Pauly, Arno

Abstract

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...

Full description

Published in: Information and Computation
ISSN: 08905401
Published: 2018
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa37648
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: 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.
College: College of Science