Admissiblity in concurrent games

DOI10.4230/LIPICS.ICALP.2017.123zbMATH Open1442.68124arXiv1702.06439OpenAlexW2593796845MaRDI QIDQ5111455FDOQ5111455

Ocan Sankur, G. Geeraerts, Nicolas Basset, Jean-François Raskin

Publication date: 27 May 2020

Abstract: 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

Full work available at URL: https://arxiv.org/abs/1702.06439

Recommendations

• scientific article; zbMATH DE number 6862070
• Admissible strategies in timed games
• Admissible Strategies in Infinite Games over Graphs
• Concurrent games and semi-random determinacy
• Concurrent reachability games

zbMATH Keywords

concurrent gamesadmissibilitymulti-player gamesrandomized strategies

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Other game-theoretic models (91A40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Title not available (Why is that?)
• A game-theoretic approach for the synthesis of complex systems
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Admissiblity in concurrent games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111455)