License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.375
URN: urn:nbn:de:0030-drops-33340
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3334/
Bouyer, Patricia ;
Brenguier, Romain ;
Markey, Nicolas ;
Ummels, Michael
Nash Equilibria in Concurrent Games with Büchi Objectives
Abstract
We study the problem of computing pure-strategy Nash equilibria in multiplayer concurrent games with Büchi-definable objectives. First, when the objectives are Büchi conditions on the game, we prove that the existence problem can be solved in polynomial time. In a second part, we extend our technique to objectives defined by deterministic Büchi automata, and prove that the problem then becomes EXPTIME-complete. We prove PSPACE-completeness for the case where the Büchi automata are 1-weak.
BibTeX - Entry
@InProceedings{bouyer_et_al:LIPIcs:2011:3334,
author = {Patricia Bouyer and Romain Brenguier and Nicolas Markey and Michael Ummels},
title = {{Nash Equilibria in Concurrent Games with B{\"u}chi Objectives}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {375--386},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Supratik Chakraborty and Amit Kumar},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3334},
URN = {urn:nbn:de:0030-drops-33340},
doi = {10.4230/LIPIcs.FSTTCS.2011.375},
annote = {Keywords: Concurrent games, Nash equilibria, B{\"u}chi Objectives}
}
Keywords: |
|
Concurrent games, Nash equilibria, Büchi Objectives |
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) |
Issue Date: |
|
2011 |
Date of publication: |
|
01.12.2011 |