Quantal-response equilibrium models of the ultimatum bargaining game

This paper investigates the implications of quantal response equilibrium (QRE) models [McKelvey and Palfrey, 1995, Games Econ. Behav. 10, 6–38; 1998, Exper. Econ. 1, 9–41] in the ultimatum bargaining game. It is shown that, in a normal-form QRE (NQRE), each bargainer's decision depends critically on the anticipated behavior of the other, and there is a NQRE in which the proposer makes any offer between zero and equal split as a strict best response. The application of NQRE to the experimental data [Slonim and Roth, 1998, Econometrica 66, 569–596] suggests that the history dependence observed in the experiment is a result of the strategic interactions between bargainers.     

Quantal Response Equilibria for Extensive Form Games

This article investigates the use of standard econometric models for quantal choice to study equilibria of extensive form games. Players make choices based on a quantal-choice model and assume other players do so as well. We define an agent quantal response equilibrium (AQRE), which applies QRE to the agent normal form of an extensive form game and imposes a statistical version of sequential rationality. We also define a parametric specification, called logit-AQRE, in which quantal-choice probabilities are given by logit response functions. AQRE makes predictions that contradict the invariance principle in systematic ways. We show that these predictions match up with some experimental findings by Schotter et al. (1994) about the play of games that differ only with respect to inessential transformations of the extensive form. The logit-AQRE also implies a unique selection from the set of sequential equilibria in generic extensive form games. We examine data from signaling game experiments by Banks et al. (1994) and Brandts and Holt (1993). We find that the logit-AQRE selection applied to these games succeeds in predicting patterns of behavior observed in these experiments, even when our prediction conflicts with more standard equilibrium refinements, such as the intuitive criterion. We also reexamine data from the McKelvey and Palfrey (1992) centipede experiment and find that the AQRE model can account for behavior that had previously been explained in terms of altruistic behavior. This revised version was published online in August 2006 with corrections to the Cover Date.     

Payoff dominance and risk dominance in the observable delay game: a note

We examine whether the payoff dominant sequential-move (Stackelberg) outcome is realized when timing is endogenized. We adopt the observable delay game formulated by Hamilton and Slutsky [Games Econ Behav 2(1):29–46, 1990]. We find that if one sequential-move outcome is payoff dominant, either (i) the outcome both players prefer is the unique equilibrium; or (ii) two sequential-move outcomes are equilibria and the one both players prefer is risk dominant. In other words, no conflict between payoff dominance and risk dominance in the observable delay game exists, in contrast to other games such as (non pure) coordination games. We also find that even if one of two sequential-move outcomes is the unique equilibrium outcome in the observable delay game, it does not imply that the equilibrium outcome is payoff dominant to the other sequential-move outcome.      

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.     

Competitive behavior in market games: Evidence and theory

We explore whether competitive outcomes arise in an experimental implementation of a market game, introduced by Shubik (1973) [21]. Market games obtain Pareto inferior (strict) Nash equilibria, in which some or possibly all markets are closed. We find that subjects do not coordinate on autarkic Nash equilibria, but favor more efficient Nash equilibria in which all markets are open. As the number of subjects participating in the market game increases, the Nash equilibrium they achieve approximates the associated competitive equilibrium of the underlying economy. Motivated by these findings, we provide a theoretical argument for why evolutionary forces can lead to competitive outcomes in market games.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Non-existence of monotone equilibria in games with correlated signals

Participation in economic games such as auctions is typically costly, which means that players (potential bidders) must consider whether to participate. Such decisions may be no less crucial than how to bid, and yet the literature has been mostly concerned with bidding, assuming an exogenously given number of bidders; see Krishna [Auction Theory, Academic Press, New York, 2002]. Landsberger and Tsirelson [Correlated signals against monotone equilibria, preprint SSRN 222308, Social Science Research Network Electronic Library, May 2000. Available online: http://papers.ssrn.com/abstract=222308] have shown that fundamental results established in symmetric auction theory with correlated signals, such as the existence of a monotone equilibrium, may not hold if participation decisions are part of equilibrium. The major goal of this paper is to illustrate and explain this result that may be considered counter intuitive given the emphasis placed on monotone equilibria in the auction literature.     

The type-agent core for exchange economies with asymmetric information

The type-agent core is a new solution concept for exchange economies with asymmetric information. It coincides with the set of subgame-perfect equilibrium outcomes of a simple competitive screening game. Uninformed intermediaries help the agents to cooperate in an attempt to make some profit. The paper extends the work of Perez-Castrillo [Cooperative outcomes through non-cooperative games, Games Econ. Behav. 7 (1994) 428-440] to exchange economies with non-transferable utility and asymmetric information. The type-agent core is a subset of Wilson's coarse core [Wilson, Information, efficiency, and the core of an economy, Econometrica 46 (1978) 807-816]. It is never empty, even though it may be a strict subset of Wilson's fine core. In addition, it converges towards the set of constrained market equilibria as the economy is replicated.     

A STATISTICAL THEORY OF EQUILIBRIUM IN GAMES*

This paper describes a statistical model of equiliobrium behaviour in games, which we call Quantal Response Equilibrium (QRE). The key feature of the equilibrium is that individuals do not always play responses to the strategies of their opponents, but play better strategies with higher probability than worse strategies. we illustrate several different applications of this approach, and establish a number of theoretical properties of this equilibrium concept. We also demonstrate an equililance between this equilibrium notion and Bayesian games derived from games of complete information with perturbed payoffs     

Dominant strategy implementation in economic environments

We study dominant strategy implementation especially in economic environments. We first show that in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelation mechanism. We next prove that in weak separable environments, strategy-proofness is sufficient for dominant strategy implementation, by using an augmented revelation mechanism similar to the one devised by Jackson, Palfrey, and Srivastava [Jackson, M.O., Palfrey, T.R., Srivastava, S., 1994. Undominated Nash implementation in bounded mechanisms. Games Econ. Behav. 6, 474–501]. Moreover, we focus on pure exchange economies without free disposal, and try to construct another augmented revelation mechanism that satisfies balancedness in and out of equilibrium, and which implements all strategy-proof social choice functions in dominant strategy equilibria.     

Generalized potentials and robust sets of equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions. These sufficient conditions unify and generalize existing sufficient conditions. Our generalization of potential games is useful in other game theoretic problems where potential methods have been applied.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

Homotopy methods to compute equilibria in game theory

This paper presents a survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present the relevant techniques underlying homotopy algorithms. We give detailed expositions of the Lemke–Howson algorithm and the van den Elzen–Talman algorithm to compute Nash equilibria in 2-person games, and the Herings–van den Elzen, Herings–Peeters, and McKelvey–Palfrey algorithms to compute Nash equilibria in general n-person games. We explain how the main ideas can be extended to compute equilibria in extensive form and dynamic games, and how homotopies can be used to compute all Nash equilibria.     

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     

Cournot–Nash equilibria in continuum games with non-ordered preferences

In the usual framework of continuum games with externalities, we substantially generalize Cournot–Nash existence results [Balder, A unifying approach to existence of Nash equilibria, Int. J.Game Theory 24 (1995) 79–94; On the existence of Cournot–Nash equilibria in continuum games, J. Math. Econ. 32 (1999) 207–223; A unifying pair of Cournot–Nash equilibrium existence results, J. Econ. Theory 102 (2002) 437–470] to games with possibly non-ordered preferences, providing a continuum analogue of the seminal existence results by Mas-Colell [An equilibrium existence theorem without complete or transitive preferences, J. Math. Econ. 1 (1974) 237–246], Gale and Mas-Colell [An equilibrium existence theorem for a general model without ordered preferences, J. Math. Econ. 2 (1975) 9–15], Shafer and Sonnenschein [Equilibrium in abstract economies without ordered preferences, J. Math. Econ. 2 (1975) 345–348], Borglin and Keiding [Existence of equilibrium actions and of equilibrium: a note on the “new” existence theorems, J. Math. Econ. 3 (1976) 313–316] and Yannelis and Prabhakar [Existence of maximal elements and equilibria in linear topological spaces, J. Math. Econ. 12 (1983) 233–245].     

Nash equilibrium and generalized integration for infinite normal form games

Infinite normal form games that are mathematically simple have been treated [ Harris, C.J., Stinchcombe, M.B., Zame, W.R., in press. Nearly compact and continuous normal form games: characterizations and equilibrium existence. Games Econ. Behav.]. Under study in this paper are the other infinite normal form games, a class that includes the normal forms of most extensive form games with infinite choice sets.Finitistic equilibria are the limits of approximate equilibria taken along generalized sequences of finite subsets of the strategy spaces. Points must be added to the strategy spaces to represent these limits. There are direct, nonstandard analysis, and indirect, compactification and selection, representations of these points. The compactification and selection approach was introduced [Simon, L.K., Zame, W.R., 1990. Discontinuous games and endogenous sharing rules. Econometrica 58, 861–872]. It allows for profitable deviations and introduces spurious correlation between players' choices. Finitistic equilibria are selection equilibria without these drawbacks. Selection equilibria have drawbacks, but contain a set-valued theory of integration for non-measurable functions tightly linked to, and illuminated by, the integration of correspondences.     

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.     

Subgame perfect reaction function equilibria in discounted duopoly supergames are trivial

This paper is concerned with infinitely repeated duopoly games with discounting. A question which has been open since Friedman's (Rev. Econ. Stud. 35 (1968), 257–272) reaction function article is settled for a general class of games. The question is wheter nontrivial reaction function equilibria can be subgame perfect. This question is answered in the negative. Such equilibria must be trivial in the sense of prescribing the stage game noncooperative equilibrium actions in every period, independent of prior history.     

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.     

On the beliefs off the path: Equilibrium refinement due to quantal response and level-k

The extensive form game we study has multiple perfect equilibria, but it has a unique limiting logit equilibrium (QRE) and a unique level-k prediction as k approaches infinity. The convergence paths of QRE and level-k are different, but they converge to the same limit point. We analyze whether subjects adapt beliefs when gaining experience, and if so whether they take the QRE or the level-k learning path. We estimate transitions between level-k and QRE belief rules using Markov-switching rule learning models. The analysis reveals that subjects take the level-k learning path and that they advance gradually, switching from level 1 to 2, from level 2 to equilibrium, and reverting to level 1 after observing opponents deviating from equilibrium. The steady state therefore contains a mixture of behavioral rules: levels 0, 1, 2, and equilibrium with weights of 2.9%, 16.6%, 37.9%, and 42.6%, respectively.