2026-07-21T14:16:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6877 2024-03-06T10:39:05Z ddc:004 open_access

Admissibility in Quantitative Graph Games Brenguier, Romain Pérez, Guillermo A. Raskin, Jean-Francois Sankur, Ocan Quantitative games Verification Reactive synthesis Admissibility Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, under the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the notion of adversarial and cooperative values of a history, and we characterize the set of outcomes that are compatible with admissible strategies. Finally, we show how these characterizations can be used to design algorithms to decide relevant verification and synthesis problems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Romain Brenguier and Guillermo A. Pérez and Jean-Francois Raskin and Ocan Sankur 2016 Is Part Of LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2016.42 urn:nbn:de:0030-drops-68772 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.42 eng https://creativecommons.org/licenses/by/3.0/legalcode