We introduce a condition, Nash-equivalent self-confirming equilibrium. If beliefs are assumed to be independent and unitary, Nash-equivalent self-confirming equilibrium and Nash equilibrium are outcome-equivalent. We show that the set of Nash-equivalent self-confirming equilibria and the set of...

We prove that the structure theorem for rationalizability originally from Weinstein and Yildiz (2007) applies to any finite extensive-form game with perfect recall and suitably rich payoffs. We demonstrate that the ties induced by the extensive form do not change the result of Weinstein and...

We define generalized extensive-form games which allow for asymmetric awareness of actions. We extend Pearceʼs (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties, and prove existence.

Several studies show that evolution favors non-selfish preferences only if preference types are observable. We present a new evolutionary scenario applied to the Centipede Game, where we adopt self-confirming equilibrium to capture behavior. We show that altruism may be evolutionarily successful...

We analyze a family of extensive-form solution procedures for games with incomplete information that do not require the specification of an epistemic type space a la Harsanyi, but can accommodate a (commonly known) collection of explicit restrictions D on first-order beliefs. For any fixed D we...

The theory of learning in games explores how, which, and what kind of equilibria might arise as a consequence of a long-run nonequilibrium process of learning, adaptation, and/or imitation. If agents’ strategies are completely observed at the end of each round (and agents are randomly matched...

Making use of and following substantive rationality is a costly and not always feasible option. In games, this option generates two levels of reasoning. The player has to decide how to play the overt game, but this requires him to decide how to play an underlying game in which the alternatives...

The electronic mail game of Rubinstein (1989) showed that a lack of common knowledge generated by faulty communication can make coordinated action impossible. This paper shows how this conclusion is robust to having a more realistic timing structure of messages, more than two players who meet...

We study coordination in dynamic global games with private learning. Players choose whether and when to invest irreversibly in a project whose success depends on its quality and the timing of investment. Players gradually learn about project quality. We identify conditions on temporal incentives...

We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their...