2017/02/21 by Nicolas Basset, Basset, Nicolas, Gilles Geeraerts +5
Computer Science · Decision Sciences · #Computability, Logic, AI Algorithms #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #cs.GT #cs.LO
paper · pdf · doi:10.48550/arxiv.1702.06439
arxiv created 2017/02/21 · openalex publication_date 2017/02/21 · arxiv updated 2017/02/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 super set 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