Infinite Coordination Games [chapter]

Dietmar Berwanger
2010 Lecture Notes in Computer Science  
We investigate the prescriptive power of sequential iterated admissibility in coordination games of the Gale-Stewart style, i.e., perfectinformation 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.
doi:10.1007/978-3-642-15164-4_1 fatcat:zd7es75s5bfq3i5cumfoimv4ha