DROPS

Document

DOI: 10.4230/LIPIcs.CONCUR.2018.38

The Complexity of Rational Synthesis for Concurrent Games

Authors: Rodica Condurache, Youssouf Oualhadj, and Nicolas Troquard

Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)

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.

Cite as

Rodica Condurache, Youssouf Oualhadj, and Nicolas Troquard. The Complexity of Rational Synthesis for Concurrent Games. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 38:1-38:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{condurache_et_al:LIPIcs.CONCUR.2018.38,
  author =	{Condurache, Rodica and Oualhadj, Youssouf and Troquard, Nicolas},
  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 =	{Schewe, Sven and Zhang, Lijun},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.38},
  URN =		{urn:nbn:de:0030-drops-95766},
  doi =		{10.4230/LIPIcs.CONCUR.2018.38},
  annote =	{Keywords: Synthesis, concurrent games, Nash equilibria}
}

Search Results

Documents authored by Troquard, Nicolas

The Complexity of Rational Synthesis for Concurrent Games

Abstract

Cite as

Thanks for your feedback!

Could not send message