Journal article 1137 views 210 downloads
Extending finite-memory determinacy to multi-player games
Information and Computation, Volume: 261, Pages: 676 - 694
Swansea University Author:
Arno Pauly
-
PDF | Accepted Manuscript
Released under the terms of a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).
Download (315.66KB)
DOI (Published version): 10.1016/j.ic.2018.02.024
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...
| Published in: | Information and Computation |
|---|---|
| ISSN: | 0890-5401 |
| Published: |
Elsevier BV
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. |
|---|---|
| Keywords: |
Finite memory; Games played on finite graphs; Finite-memory determinacy; Nash equilibrium; Equilibrium transfer; Energy parity games |
| College: |
Faculty of Science and Engineering |
| Start Page: |
676 |
| End Page: |
694 |