LIPIcs.FSTTCS.2009.2330.pdf
- Filesize: 119 kB
- 12 pages
Document
Nash Equilibrium in Generalised Muller Games
Authors
-
Part of:
Volume:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-12-14
Cite As Get BibTex
Soumya Paul and Sunil Simon. Nash Equilibrium in Generalised Muller Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 335-346, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2330
Abstract
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solution concept of Nash equilibrium for non-zero sum games. We show that Nash equilibria always exists for such generalised Muller games on finite graphs and present a procedure to compute an equilibrium strategy profile. We also give a procedure to compute a subgame perfect equilibrium when it exists in such games.
Subject Classification
Keywords
- Infinite games on graphs
- Muller games
- Nash equilibrium
- subgame perfect equilibrium
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads