Well-founded extensive games with perfect information
We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations for two classes of these games in which subgame perfect equilibria exist: two-player zero-sum games with, respectively, two and three outcomes.
|18th Conference on Theoretical Aspects of Rationality and Knowledge|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Apt, K.R, & Simon, S.E. (2021). Well-founded extensive games with perfect information. In Electronic Proceedings in Theoretical Computer Science, EPTCS (pp. 7–21). doi:10.4204/EPTCS.335.2