A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Admissibility in Infinite Games
[chapter]
STACS 2007
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
doi:10.1007/978-3-540-70918-3_17
dblp:conf/stacs/Berwanger07
fatcat:e2zxrcnklnh4djblk2i357yp6a