Admissiblity in Concurrent Games - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Admissiblity in Concurrent Games

Résumé

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 ω-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.
Fichier principal
Vignette du fichier
LIPIcs-ICALP-2017-123.pdf (670.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01598148 , version 1 (16-11-2017)

Identifiants

Citer

Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur. Admissiblity in Concurrent Games. ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Jul 2017, Warsaw, Poland. pp.123:1-123:14, ⟨10.4230/LIPIcs.ICALP.2017.123⟩. ⟨hal-01598148⟩
548 Consultations
76 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More