FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
Beyond admissibility: Dominance between chains of strategies

Authors: Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-Francois Raskin and Marie Van Den Bogaard

Paper Information

Title:Beyond admissibility: Dominance between chains of strategies
Authors:Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-Francois Raskin and Marie Van Den Bogaard
Proceedings:SR SR18 papers
Editors: Nicolas Markey and Patricia Bouyer
Keywords:games played on finite graphs, dominance, rationality, increasing chains, order theory, admissibility
Abstract:

ABSTRACT. 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.

Pages:14
Talk:Jul 07 17:20 (Session 31P: Multiple-player games)
Paper: