This paper aspires to fill a conspicuous gap in the literature regarding learning in games—the absence of empirical verification of learning rules involving pattern recognition. Weighted fictitious play is extended to detect two-period patterns in opponentsʼ behavior and to comply with the...

Belief models capable of detecting 2- to 5-period patterns in repeated games by matching the current historical context to similar realizations of past play are presented. The models are implemented in a cognitive framework, ACT-R, and vary in how they implement similarity-based...

It has been suggested that players often produce simplified and/or misspecified mental representations of interactive decision problems (Kreps, 1990). We submit that the relational structure of players' preferences in a game induces cognitive complexity, and may be an important driver of such...

We introduce a “dynamic non-equivalent utilities” (DNEU) condition and the notion of dynamic player-specific punishments for a general repeated game with unequal discounting, both naturally generalizing the stationary counterparts in Abreu et al. (1994). We show that if the DNEU condition,...

The e-mail game in Rubinstein (1989) shows that types with arbitrarily close higher-order beliefs may differ substantially in strategic behaviors. We define a notion called strategic discontinuity in arbitrary incomplete-information scenarios to generalize this e-mail game phenomenon. We show...

We consider dynamic group formation in repeated n-person prisonerʼs dilemma. Agreements in coalitional bargaining are self-binding in that they are supported as subgame perfect equilibria of repeated games. Individuals are allowed to renegotiate the cooperating group agreement through a process...

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for potential applications of asymmetric unawareness. Applying our unawareness belief structures, we show that the common prior assumption is too weak to rule out...

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...

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.

This paper studies the learning process carried out by two agents who are involved in many games. As distinguishing all games can be too costly (require too much reasoning resources) agents might partition the set of all games into categories. Partitions of higher cardinality are more costly. A...