Publication
Title
Minimizing regret in discounted-sum games
Author
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.
Language
English
Source (journal)
LIPIcs : Leibniz International Proceedings in Informatics. - Place of publication unknown
Source (book)
25th EACSL Annual Conference on Computer Science Logic (CSL 2016), August 29 - September 1, 2016; Marseille, France / Talbot, Jean-Marc [edit.]; et al.
Publication
Germany : Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik, 2016
ISBN
978-3-95977-022-4
Volume/pages
62(2016), 17 p.
Article Reference
30
Medium
E-only publicatie
Full text (Publisher's DOI)
Full text (open access)
UAntwerpen
Publication type
Subject
External links
Record
Identification
Creation 19.11.2018
Last edited 12.10.2020