Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.30
URN: urn:nbn:de:0030-drops-65704
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6570/
Hunter, Paul ; Pérez, Guillermo A. ; Raskin, Jean-François
Minimizing Regret in Discounted-Sum Games
| pdf-format: |
|
Abstract
In this paper, we study the problem of minimizing regret in discounted-sum games played on weighted game graphs. We give algorithms for the general problem of computing the minimal regret of the controller (Eve) as well as several variants depending on which strategies the environment (Adam) is permitted to use. We also consider the problem of synthesizing regret-free strategies for Eve in each of these scenarios.
BibTeX - Entry
@InProceedings{hunter_et_al:LIPIcs:2016:6570,
author = {Paul Hunter and Guillermo A. P{\'e}rez and Jean-Fran{\c{c}}ois Raskin},
title = {{Minimizing Regret in Discounted-Sum Games}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {30:1--30:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Jean-Marc Talbot and Laurent Regnier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6570},
URN = {urn:nbn:de:0030-drops-65704},
doi = {10.4230/LIPIcs.CSL.2016.30},
annote = {Keywords: Quantitative games, Regret, Verification, Synthesis, Game theory}
}
| Keywords: | Quantitative games, Regret, Verification, Synthesis, Game theory | |
| Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 29.08.2016 |
