文章基本信息

标题：Beyond Admissibility: Dominance Between Chains of Strategies
本地全文：下载
作者：Nicolas Basset ; Isma{\"e}l Jecker ; Arno Pauly 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2018
卷号：119
页码：1-22
DOI：10.4230/LIPIcs.CSL.2018.10
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by results showing that any strategy is admissible or dominated by an admissible strategy. However, in games played on finite graphs with quantitative objectives (as used for reactive synthesis), this is not the case. We consider increasing chains of strategies instead to recover a satisfactory rationality notion based on dominance in such games. We start with some order-theoretic considerations establishing sufficient criteria for this to work. We then turn our attention to generalised safety/reachability games as a particular application. We propose the notion of maximal uniform chain as the desired dominance-based rationality concept in these games. Decidability of some fundamental questions about uniform chains is established.
关键词：dominated strategies; admissible strategies; games played on finite graphs; reactive synthesis; reachability games; safety games; cofinal; order theor