2026-07-25T16:23:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9622 2024-03-06T10:44:33Z ddc:004 open_access

Concurrent Games and Semi-Random Determinacy Le Roux, Stéphane Two-player win/lose graph infinite duration abstract winning condition 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stéphane Le Roux 2018 Is Part Of LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2018.40 urn:nbn:de:0030-drops-96220 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.40 eng https://creativecommons.org/licenses/by/3.0/legalcode