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.MFCS.2018.40
URN: urn:nbn:de:0030-drops-96220
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9622/
Go to the corresponding LIPIcs Volume Portal

Le Roux, Stéphane

Concurrent Games and Semi-Random Determinacy

pdf-format:
LIPIcs-MFCS-2018-40.pdf (0.4 MB)

Abstract

Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of winning (finite-memory) strategies in finitely many derived one-player games. Several classical winning conditions satisfy this simple requirement.
Under an additional requirement on the winning condition, the non-existence of Player 1 winning strategies from all vertices is equivalent to the existence of Player 2 stochastic strategies almost-sure winning from all vertices. Only few classical winning conditions satisfy this additional requirement, but a fairness variant of omega-regular languages does.

BibTeX - Entry

@InProceedings{leroux:LIPIcs:2018:9622,
  author =	{St{\'e}phane Le Roux},
  title =	{{Concurrent Games and Semi-Random Determinacy}},
  booktitle =	{43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)},
  pages =	{40:1--40:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-086-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{117},
  editor =	{Igor Potapov and Paul Spirakis and James Worrell},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9622},
  URN =		{urn:nbn:de:0030-drops-96220},
  doi =		{10.4230/LIPIcs.MFCS.2018.40},
  annote =	{Keywords: Two-player win/lose, graph, infinite duration, abstract winning condition}
}

Keywords: Two-player win/lose, graph, infinite duration, abstract winning condition
Collection: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Issue Date: 2018
Date of publication: 27.08.2018

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