Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Games in system design and verification
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Order independence and rationalizability
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Two-player nonzero-sum ω-regular games
CONCUR 2005 - Concurrency Theory
A generic constructive solution for concurrent games with expressive constraints on strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
| Hi-index | 0.00 |
We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strategies, as a solution concept for extensive games of infinite horizon. This concept is known to provide a valuable criterion for selecting among multiple equilibria and to yield sharp predictions in finite games. However, generalisations to the infinite are inherently problematic, due to unbounded dominance chains and the requirement of transfinite induction. In a multi-player non-zero-sum setting, we show that for infinite extensive games of perfect information with only two possible payoffs (win or lose), the concept of iterated admissibility is sound and robust: all iteration stages are dominated by admissible strategies, the iteration is non-stagnating, and, under regular winning conditions, strategies that survive iterated elimination of dominated strategies form a regular set.