2026-08-17T15:46:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6570 2024-03-06T10:38:44Z ddc:004 open_access

Minimizing Regret in Discounted-Sum Games Hunter, Paul Pérez, Guillermo A. Raskin, Jean-François Quantitative games Regret Verification Synthesis Game theory 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paul Hunter and Guillermo A. Pérez and Jean-François Raskin 2016 Is Part Of LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2016.30 urn:nbn:de:0030-drops-65704 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.30 eng https://creativecommons.org/licenses/by/3.0/legalcode