文章基本信息

标题：Minimizing Regret in Discounted-Sum Games
本地全文：下载
作者：Paul Hunter ; Guillermo A. P{\'e}rez ; Jean-Fran{\c{c}}ois Raskin 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：62
页码：30:1-30:17
DOI：10.4230/LIPIcs.CSL.2016.30
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Quantitative games; Regret; Verification; Synthesis; Game theory