Admissiblity in Concurrent Games

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 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.
Type de document :
Communication dans un congrès
ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, Jul 2017, Warsaw, Poland. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 80, pp.123:1-123:14, 2017, LIPICs. 〈10.4230/LIPIcs.ICALP.2017.123〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01598148
Contributeur : Ocan Sankur <>
Soumis le : jeudi 16 novembre 2017 - 15:05:00
Dernière modification le : jeudi 7 février 2019 - 16:53:22
Document(s) archivé(s) le : samedi 17 février 2018 - 14:50:05

Fichier

LIPIcs-ICALP-2017-123.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 80, pp.123:1-123:14, 2017, LIPICs. 〈10.4230/LIPIcs.ICALP.2017.123〉. 〈hal-01598148〉

Partager

Métriques

Consultations de la notice

444

Téléchargements de fichiers

26