2026-07-30T13:27:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7476 2024-03-06T10:40:32Z ddc:004 open_access

Admissiblity in Concurrent Games Basset, Nicolas Geeraerts, Gilles Raskin, Jean-François Sankur, Ocan Multi-player games admissibility concurrent games randomized strategies In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays 'as well as possible', because there is no other strategy that dominates it, i.e., that wins (almost surely) against a superset of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we characterise them precisely. Then, when the objectives of the players are omega-regular, we show how to perform assume-admissible synthesis, i.e., how to compute admissible strategies that win (almost surely) under the hypothesis that the other players play admissible strategies only. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nicolas Basset and Gilles Geeraerts and Jean-François Raskin and Ocan Sankur 2017 Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2017.123 urn:nbn:de:0030-drops-74765 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.123 eng https://creativecommons.org/licenses/by/3.0/legalcode