Infinite coordination games

Authors:
Dietmar Berwanger
Affiliations:
Laboratoire Spécification et Vérification, Centre National de la Recherche Scientifique & École Normale Supérieure de Cachan, Cachan, France
Venue:
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
Year:
2008

Citing 4
Cited 1

Alternating-time temporal logic

Journal of the ACM (JACM)
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Games in system design and verification

TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Admissibility in infinite games

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Information Tracking in Games on Graphs

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the prescriptive power of sequential iterated admissibility in coordination games of the Gale-Stewart style, i.e., perfect-information games of infinite duration with only two payoffs. We show that, on this kind of games, the procedure of eliminating weakly dominated strategies is independent of the elimination order and that, under maximal simultaneous elimination, the procedure converges after at most ω many stages.