Conference Paper/Proceeding/Abstract 814 views 46 downloads
Beyond Admissibility: Dominance Between Chains of Strategies
Nicolas Basset,
Ismael Jecker,
Arno Pauly 
,
Jean-Francois Raskin,
Marie van den Bogaard
,
Jean-Francois Raskin,
Marie van den Bogaard
Swansea University Author:
Arno Pauly
DOI (Published version): 10.4230/LIPIcs.CSL.2018.10
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 gr...
| Published: |
Computer Science Logic (CSL)
2018
|
|---|---|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa43771 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|---|
| College: |
Faculty of Science and Engineering |