|
Title
|
|
|
|
Admissibility in quantitative graph games
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| 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. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
LIPIcs : Leibniz International Proceedings in Informatics. - Place of publication unknown
| |
|
Source (book)
|
|
|
|
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), December 13-15, 2016, Chennai, India / Lal, Akash [edit.]; et al.
| |
|
Publication
|
|
|
|
Germany
:
Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik
,
2016
| |
|
ISBN
|
|
|
|
978-3-95977-027-9
| |
|
Volume/pages
|
|
|
|
65
(2016)
, 14 p.
| |
|
Article Reference
|
|
|
|
42
| |
|
Medium
|
|
|
|
E-only publicatie
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (open access)
|
|
|
|
| |
|