Computing sequential equilibria using agent quantal response equilibria

The limit of any convergent sequence of agent quantal response equilibria is a sequential equilibrium of an extensive game. Using a logarithmic transformation of action probabilities, it is numerically feasible and practical to compute such sequences, and thereby compute good approximations to sequential equilibrium assessments. This paper describes the algorithm to compute the sequences, and outlines the convergence and selection properties of the method.     

Sequential equilibrium in monotone games: A theory-based analysis of experimental data

A monotone game is an extensive-form game with complete information, simultaneous moves and an irreversibility structure on strategies. It captures a variety of situations in which players make partial commitments and allows us to characterize conditions under which equilibria result in socially desirable outcomes. However, since the game has many equilibrium outcomes, the theory lacks predictive power. To produce stronger predictions, one can restrict attention to the set of sequential equilibria, or Markov equilibria, or symmetric equilibria, or pure-strategy equilibria. This paper explores the relationship between equilibrium behavior in a class of monotone games, namely voluntary contribution games, and the behavior of human subjects in an experimental setting. Several key features of the symmetric Markov perfect equilibrium (SMPE) are consistent with the data. To judge how well the SMPE fits the data, we estimate a model of Quantal Response Equilibrium (QRE) [R. McKelvey, T. Palfrey, Quantal response equilibria for normal form games, Games Econ. Behav. 10 (1995) 6-38; R. McKelvey, T. Palfrey, Quantal response equilibria for extensive form games, Exp. Econ. 1 (1998) 9-41] and find that the decision rules of the QRE model are qualitatively very similar to the empirical choice probabilities.     

Level-k analysis of experimental centipede games

As one of the best-known examples of the paradox of backward induction, centipede games have prompted a host of studies with various approaches and explanations (McKelvey and Palfrey, 1992, Fey et al., 1996, Nagel and Tang, 1998, Rapoport et al., 2003, Palacios-Huerta and Volij, 2009). Focusing on initial plays observed in experiments, this paper attempts to offer another explanation based on thorough study of level-k models as applied to these games. Borrowing ideas from the cognitive hierarchy model (Camerer et al., 2004), the authors constructed a group of models based on levels of rationality, and also tested for various assumptions on the play of the most naïve player type in these models. It was found that level-k models generally perform better than the agent quantal response equilibrium (AQRE) model and its variant with altruistic player types for increasing-pie centipede games, while the AQRE model with altruistic player types performs better in constant-pie games.     

Order of Play, Forward Induction, and Presentation Effects in Two-Person Games

We investigate the effects of order-of-play (simultaneous, unobserved sequential and fully observed sequential play) and form of presentation (extensive vs. normal) in three simple two person games: battle-of-the-sexes with and without outside option and a three strategy game which differentiates between virtual observability (VO) and iterated elimination of dominated strategies as principles of equilibrium selection. VO predicts that knowledge of the order of play alone will affect the distribution of strategies chosen. We contrast this with the predictions of iterated elimination of dominated strategies. We report results from 1800 one-shot games conducted in 6 sessions with 120 subjects and analysed as panel data. The form of presentation strongly affects the distribution of outcomes and strategies. Information about order of play shifts the distribution of strategies away from the distribution in simultaneous play and towards the distribution in fully observed play, especially in the less complicated games presented in normal order. Order-of-play effects are less evident as complexity of the game increases. Extensive form presentation appears to induce sequential thinking even in simultaneously played games.     

Bayesian games with unawareness and unawareness perfection

Applying unawareness belief structures introduced in Heifetz et al. (Games Econ Behav 77:100–121, 2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower awareness levels. We apply Bayesian games with unawareness to investigate the robustness of equilibria to uncertainty about opponents’ awareness of actions. We show that a Nash equilibrium of a strategic game is robust to unawareness of actions if and only if it is not weakly dominated. Finally, we discuss the relationship between standard Bayesian games and Bayesian games with unawareness.     

Strategic knowledge sharing in Bayesian games

This paper provides a model for the study of direct, public and strategic knowledge sharing in Bayesian games. We propose an equilibrium concept which takes into account communication possibilities of exogenously certifiable statements and in which beliefs off the equilibrium path are explicitly deduced from consistent possibility correspondences, without making reference to perturbed games. Properties of such an equilibrium and of revised knowledge are examined. In particular, it is shown that our equilibrium is always a sequential equilibrium of the associated extensive form game with communication. Finally, sufficient conditions for the existence of perfectly revealing or non-revealing equilibria are characterized in some classes of games. Several examples and economic applications are investigated.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.     

Adaptive learning in extensive form games and sequential equilibrium

Summary. This paper studies adaptive learning in extensive form games and provides conditions for convergence points of adaptive learning to be sequential equilibria. Precisely, we present a set of conditions on learning sequences such that an assessment is a sequential equilibrium if and only if there is a learning sequence fulfilling the conditions, which leads to the assessment. Received: November 5, 1996; revised version: May 28, 1997     

Endogenous private information structures

We formally incorporate the option to gather information into a game and thus endogenize the information structure. We ask whether models with exogenous information structures are robust with respect to this endogenization. Any Nash equilibrium of the game with information acquisition induces a Nash equilibrium in the corresponding game with an exogenous structure. We provide sufficient conditions on the structure of the game for which this remains true when ‘Nash’ is replaced by ‘sequential’. We characterize the (sequential) Nash equilibria of games with exogenous information structures that can arise as a (sequential) Nash equilibrium of games with endogenous information acquisition.     

A unified approach to comparative statics puzzles in experiments

The paper shows that several game-theoretic solution concepts provide similar comparative statics predictions over a wide class of games. I start from the observation that, in many experiments, behavior is affected by parameter shifts that leave the Nash equilibrium unchanged. I explain the direction of change with a heuristic structural approach, using properties such as strategic complementarities and increasing differences. I show that the approach is consistent with general comparative statics results for (i) the Nash equilibrium of a game with perturbed payoff functions, (ii) the quantal response equilibrium, (iii) level-k reasoning. I also relate the structural approach to equilibrium selection concepts.     

Unobservable Contracts as Precommitments

It is well known that signing publicly observable contracts with third parties is a means of credibly committing to certain actions and hence may yield strategic advantages. Previous work on the commitment value of unobservable contracts has been limited to normal form games and extensive form games in which only one party has the option to sign a contract. In this paper, we extend the analysis to extensive form games in which both players can sign contracts, and characterize the set of sequential equilibria. We show that any Nash equilibrium outcome of the original game in which both players receive more than their individually rational payoffs can be supported as a sequential equilibrium outcome. Therefore, delegation acts not only as a commitment device to gain advantage over the opponent, but also as a cooperative device to attain Pareto improvements over the subgame perfect equilibrium outcome. I would like to thank Atila Abdulkadiroglu, Jean-Pierre Benoit, Alberto Bisin, Boyan Jovanovic, Ehud Kalai, Giuseppe Lopomo, George Mailath, Efe Ok, Ariel Rubinstein, Andy Schotter, seminar participants at various universities and conferences, and anonymous referees for helpful comments and suggestions. Support from the Alfred P. Sloan Foundation and Program for Economic Research at Columbia University is also gratefully acknowledged.     

The One-Shot-Deviation Principle for Sequential Rationality

This article analyzes the fictitious play process originally proposed for strategic form games by Brown (1951) and Robinson (1951). We interpret the process as a model of preplay thinking performed by players before acting in a one-shot game. This model is one of bounded rationality. We discuss how fictitious play should then be defined for extensive form games and conclude that this is somewhat problematic. We therefore study two alternative definitions. For either of these, under a weak condition of initial uncertainty, a convergence point of a fictitious play sequence is a sequential equilibrium. For generic games of perfect information initial uncertainty also implies convergence of fictitious play.Journal of Economic LiteratureClassification Number: C72.     

Fictitious Play in Extensive Form Games

This article analyzes the fictitious play process originally proposed for strategic form games by Brown (1951) and Robinson (1951). We interpret the process as a model of preplay thinking performed by players before acting in a one-shot game. This model is one of bounded rationality. We discuss how fictitious play should then be defined for extensive form games and conclude that this is somewhat problematic. We therefore study two alternative definitions. For either of these, under a weak condition of initial uncertainty, a convergence point of a fictitious play sequence is a sequential equilibrium. For generic games of perfect information initial uncertainty also implies convergence of fictitious play.Journal of Economic LiteratureClassification Number: C72.     

A Folk Theorem for Repeated Sequential Games

We study repeated sequential games where players may not move simultaneously in stage games. We introduce the concept of effective minimax for sequential games and establish a Folk theorem for repeated sequential games. The Folk theorem asserts that any feasible payoff vector where every player receives more than his effective minimax value in a sequential stage game can be supported by a subgame perfect equilibrium in the corresponding repeated sequential game when players are sufficiently patient. The results of this paper generalize those of Wen (1994), and of Fudenberg and Maskin (1986). The model of repeated sequential games and the concept of effective minimax provide an alternative view to the Anti–Folk theorem of Lagunoff and Matsui (1997) for asynchronously repeated pure coordination games.     

Regular Quantal Response Equilibrium

The structural Quantal Response Equilibrium (QRE) generalizes the Nash equilibrium by augmenting payoffs with random elements that are not removed in some limit. This approach has been widely used both as a theoretical framework to study comparative statics of games and as an econometric framework to analyze experimental and field data. The framework of structural QRE is flexible: it can be applied to arbitrary finite games and incorporate very general error structures. Restrictions on the error structure are needed, however, to place testable restrictions on the data (Haile et al., 2004). This paper proposes a reduced-form approach, based on quantal response functions that replace the best-response functions underlying the Nash equilibrium. We define a regular QRE as a fixed point of quantal response functions that satisfies four axioms: continuity, interiority, responsiveness, and monotonicity. We show that these conditions are not vacuous and demonstrate with an example that they imply economically sensible restrictions on data consistent with laboratory observations. The reduced-form approach allows for a richer set of regular quantal response functions, which has proven useful for estimation purposes. JEL Classification: D62, C73     

The local best response criterion: An epistemic approach to equilibrium refinement

The standard refinement criteria for extensive form games, including subgame perfect, perfect, perfect Bayesian, sequential, and proper, reject important classes of reasonable Nash equilibria and accept many unreasonable Nash equilibria. This paper develops a new refinement criterion, based on epistemic game theory, that captures the concept of a Nash equilibrium that is plausible when players are rational. I call this the local best response (LBR) criterion. This criterion is conceptually simpler than the standard refinement criteria because it does not depend on out-of-equilibrium, counterfactual, or passage to the limit arguments. The LBR is also informationally richer because it clarifies the epistemic conditions that render a Nash equilibrium reasonable. The LBR criterion appears to render the traditional refinement criteria superfluous.     

On the limit perfect public equilibrium payoff set in repeated and stochastic games

This paper provides a dual characterization of the existing ones for the limit set of perfect public equilibrium payoffs in a class of finite stochastic games (in particular, repeated games) as the discount factor tends to one. As a first corollary, the folk theorems of Fudenberg et al. (1994), Kandori and Matsushima (1998) and Hörner et al. (2011) obtain. As a second corollary, it is shown that this limit set of payoffs is a convex polytope when attention is restricted to perfect public equilibria in pure strategies. This result fails for mixed strategies, even when attention is restricted to two-player repeated games.     

Equilibrium selection in coordination games with simultaneous play

Summary. We apply the dynamic stochastic framework proposed in recent evolutionary literature to a class of coordination games played simultaneously by the entire population. In these games payoffs, and hence best replies, are determined by a summary statistic of the population strategy profile. We demonstrate that with simultaneous play, the equilibrium selection depends crucially on how best responses to the summary statistic remain piece-wise constant. In fact, all the strict Nash equilibria in the underlying stage game can be made stochastically stable depending on how the best response mapping generates piece-wise constant best responses. Received: February 12, 2001; revised version: October 29, 2001     

Dynamic legislative policy making

We prove existence of stationary Markov perfect equilibria in an infinite-horizon model of legislative policy making in which the policy outcome in one period determines the status quo for the next. We allow for a multidimensional policy space and arbitrary smooth stage utilities, and we assume preferences and the status quo are subject to arbitrarily small shocks. We prove that equilibrium continuation values are differentiable and that proposal strategies are continuous almost everywhere. We establish upper hemicontinuity of the equilibrium correspondence, and we provide weak conditions under which each equilibrium of our model determines an aperiodic transition probability over policies. We establish a convergence theorem giving conditions under which the invariant distributions generated by stationary equilibria must be close to the core in a canonical spatial model. Finally, we extend the analysis to sequential move stochastic games and to a version of the model in which the proposer and voting rule are determined by play of a finite, perfect information game.     

Properties and applications of dual reduction

The dual reduction process, introduced by Myerson, allows a finite game to be reduced to a smaller-dimensional game such that any correlated equilibrium of the reduced game is an equilibrium of the original game. We study the properties and applications of this process. It is shown that generic two-player normal form games have a unique full dual reduction (a known refinement of dual reduction) and all strategies that have probability zero in all correlated equilibria are eliminated in all full dual reductions. Among other applications, we give a linear programming proof of the fact that a unique correlated equilibrium is a Nash equilibrium, and improve on a result due to Nau, Gomez-Canovas and Hansen on the geometry of Nash equilibria and correlated equilibria.