This paper reconsiders the valuation equilibrium concept (Jehiel and Samet, 2007) and proposes an additional regularity condition concerning the playersʼ equilibrium strategies. The condition, which requires equilibrium strategies to induce the same local behaviour at all nodes with...

Forward induction is the notion that players in a game assume, even when confronted with an unexpected event, that their opponents chose rationally. It is often motivated by invariance, namely, that the normal form game captures all strategically relevant information. To be consistent with this...

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

We study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses or best-responses. First, we show that a necessary condition for recurrent implementation in better-response dynamics (BRD) is a small...

This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results...

This paper investigates the possibility that people discover effective heuristics when playing similar perfect information games of varying complexity. We call this discovery experience Eureka Learning. We use a change-point analysis to identify 35 percent of our subjects as Eureka Learners.

We study the implementation problem when players are prone to make mistakes. To capture the idea of mistakes, Logit Quantal Response Equilibrium (LQRE) is used, and we consider a case in which players are almost rational, i.e., the sophistication level of players approaches infinity. We show...

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

Correlation of players' actions may evolve in the common course of the play of a repeated game with perfect monitoring (“online correlation”). In this paper we study the concealment of such correlation from a boundedly rational player. We show that “strong” players, i.e., players whose...

In repeated games, subgame perfection requires all continuation strategy profiles must be effective to enforce the equilibrium; they serve as punishments should deviations occur. It does not require whether a punishment can be justified for the deviation, which creates a great deal of freedom in...