License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2018.38
URN: urn:nbn:de:0030-drops-95766
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9576/
Go to the corresponding LIPIcs Volume Portal

Condurache, Rodica ; Oualhadj, Youssouf ; Troquard, Nicolas

The Complexity of Rational Synthesis for Concurrent Games

pdf-format:
LIPIcs-CONCUR-2018-38.pdf (0.5 MB)

Abstract

In this paper, we investigate the rational synthesis problem for concurrent game structures for a variety of objectives ranging from reachability to Muller condition. We propose a new algorithm that establishes the decidability of the non cooperative rational synthesis problem that relies solely on game theoretic techniques as opposed to previous approaches that are logic based. Given an instance of the rational synthesis problem, we construct a zero-sum turn-based game that can be adapted to each one of the class of objectives. We obtain new complexity results. In particular, we show that in the cases of reachability, safety, Büchi, and co-Büchi objectives the problem is in PSpace, providing a tight upper-bound to the PSpace-hardness already established for turn-based games. In the case of Muller objective the problem is in ExpTime. We also obtain positive results when we assume a fixed number of agents, in which case the problem falls into PTime for reachability, safety, Büchi, and co-Büchi objectives.

BibTeX - Entry

@InProceedings{condurache_et_al:LIPIcs:2018:9576,
  author =	{Rodica Condurache and Youssouf Oualhadj and Nicolas Troquard},
  title =	{{The Complexity of Rational Synthesis for Concurrent Games}},
  booktitle =	{29th International Conference on Concurrency Theory  (CONCUR 2018)},
  pages =	{38:1--38:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-087-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{118},
  editor =	{Sven Schewe and Lijun Zhang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9576},
  URN =		{urn:nbn:de:0030-drops-95766},
  doi =		{10.4230/LIPIcs.CONCUR.2018.38},
  annote =	{Keywords: Synthesis, concurrent games, Nash equilibria}
}

Keywords: Synthesis, concurrent games, Nash equilibria
Collection: 29th International Conference on Concurrency Theory (CONCUR 2018)
Issue Date: 2018
Date of publication: 31.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI