Reinterpreting mixed strategy equilibria: a unification of the classical and Bayesian views

We provide a new interpretation of mixed strategy equilibria that incorporates both von Neumann and Morgenstern's classical concealment role of mixing, as well as the more recent Bayesian view originating with Harsanyi. For any two-person game, G, we consider an incomplete information game, in which each player's type is the probability he assigns to the event that his mixed strategy in G is “found out” by his opponent. We show that, generically, any regular equilibrium of G can be approximated by an equilibrium of in which almost every type of each player is strictly optimizing. This leads us to interpret i's equilibrium mixed strategy in G as a combination of deliberate randomization by i together with uncertainty on j's part about which randomization i will employ. We also show that such randomization is not unusual: for example, i's randomization is nondegenerate whenever the support of an equilibrium contains cyclic best replies.     

On the Irrelevance of Risk Attitudes in Repeated Two-Outcome Games

We study equilibrium and maximin play in supergames consisting of the sequential play of a finite collection of stage games, where each stage game has two outcomes for each player. We show that for two-player supergames in which each stage game is strictly competitive, in any Nash equilibrium of the supergame, play at each stage is a Nash equilibrium of the stage game provided preferences over certain supergame outcomes satisfy a natural monotonicity condition. In particular, equilibrium play does not depend on risk attitudes. We establish an invariance result for games with more than two players when the solution concept is subgame perfection. Journal of Economic Literature Classification Numbers: C72, C9.     

A Bayesian Model of Voting in Juries

We model voting in juries as a game of incomplete information, allowing jurors to receive a continuum of signals. We characterize the unique symmetric equilibrium of the game, and give a condition under which no asymmetric equilibria exist under unanimity rule. We offer a condition under which unanimity rule exhibits a bias toward convicting the innocent, regardless of the size of the jury, and give an example showing that this bias can be reversed. We prove a “jury theorem” for our general model: As the size of the jury increases, the probability of a mistaken judgment goes to zero for every voting rule except unanimity rule. For unanimity rule, the probability of making a mistake is bounded strictly above zero if and only if there do not exist arbitrarily strong signals of innocence. Our results explain the asymptotic inefficiency of unanimity rule in finite models and establishes the possibility of asymptotic efficiency, a property that could emerge only in a continuous model. Journal of Economic Literature Classification Numbers: C72, D72.     

Equilibrium selection through incomplete information in coordination games: an experimental study

We perform an experiment on a pure coordination game with uncertainty about the payoffs. Our game is closely related to models that have been used in many macroeconomic and financial applications to solve problems of equilibrium indeterminacy. In our experiment, each subject receives a noisy signal about the true payoffs. This game (inspired by the “global” games of Carlsson and van Damme, Econometrica, 61, 989–1018, 1993) has a unique strategy profile that survives the iterative deletion of strictly dominated strategies (thus a unique Nash equilibrium). The equilibrium outcome coincides, on average, with the risk-dominant equilibrium outcome of the underlying coordination game. In the baseline game, the behavior of the subjects converges to the theoretical prediction after enough experience has been gained. The data (and the comments) suggest that this behavior can be explained by learning. To test this hypothesis, we use a different game with incomplete information, related to a complete information game where learning and prior experiments suggest a different behavior. Indeed, in the second treatment, the behavior did not converge to equilibrium within 50 periods in some of the sessions. We also run both games under complete information. The results are sufficiently similar between complete and incomplete information to suggest that risk-dominance is also an important part of the explanation.      

The Important Thing Is Not (Always) Winning but Taking Part: Funding Public Goods with Contests

This paper considers a public good game with heterogeneous endowments and incomplete information affected by extreme free riding. I overcome this problem through the implementation of a deterministic contest in which several prizes may be awarded. I identify a monotone equilibrium, in which the contribution is strictly increasing in the endowment. I prove that it is optimal for the social planner to set the last prize equal to zero, but otherwise total expected contribution is invariant to the prize structure. Finally, I show that private provision via a contest Pareto‐dominates public provision and is higher than the total contribution raised through a lottery.     

Correlated Equilibrium in Stochastic Games

We study the existence of uniform correlated equilibrium payoffs in stochastic games. The correlation devices that we use are either autonomous (they base their choice of signal on previous signals, but not on previous states or actions) or stationary (their choice is independent of any data and is drawn according to the same probability distribution at every stage). We prove that any n-player stochastic game admits an autonomous correlated equilibrium payoff. When the game is positive and recursive, a stationary correlated equilibrium payoff exists. Journal of Economic Literature Classification Numbers: C72, C73.     

Advertising and Competition for Market Share between a New Good Producer and a Remanufacturer

We study the strategic interaction between a new good producer and a remanufacturer who use advertising campaigns to compete for a dominant share of the market for a certain good. Each firm chooses one of three possible strategies for running its advertising campaign. The two rival firms care only about capturing a dominant share of the relevant market. Hence, if a firm expects to capture dominant market share with probability p ∈ [0, 1], then its payoff in the game we study is also p. Our analysis leads to four results. First, we provide the normal form representation of the game between the new good producer and the remanufacturer. Second, we specify the game in matrix form. Third, we indicate what happens at each stage of the elimination of strictly dominated strategies. Finally, we show that the iterated elimination of strictly dominated strategies yields a clear and unique prediction about the outcome of the advertising game.     

On the Relationship between Risk-Dominance and Stochastic Stability

In a 2 × 2 symmetric game with two symmetric equilibria, one risk-dominates another if and only if the equilibrium strategy is a unique best response to any mixture that gives itself at least a probability of one-half. In a two-person strategic form game, we call a Nash equilibriumglobally risk-dominantif it consists of strategies such that each one of them is a unique best response to any mixture that gives the other at least a probability of one-half. We show that if a weakly acyclic two-person game has a globally risk-dominant equilibrium, then this is the one that is selected by the stochastic equilibrium selection process of Young.Journal of Economic LiteratureClassification Numbers: C72, C73.     

A Behavioral Learning Process in Games

This paper studies the cumulative proportional reinforcement (CPR) rule, according to which an agent plays, at each period, an action with a probability proportional to the cumulative utility that the agent has obtained with that action. The asymptotic properties of this learning process are examined for a decision-maker under risk, where it converges almost surely toward the expected utility maximizing action(s). The process is further considered in a two-player game; it converges with positive probability toward any strict pure Nash equilibrium and converges with zero probability toward some mixed equilibria (which are characterized). The CPR rule is compared in its principles with other reinforcement rules and with replicator dynamics. Journal of Economic Literature Classification Number: C72.     

The Colonel Blotto game

In the Colonel Blotto game, two players simultaneously distribute forces across n battlefields. Within each battlefield, the player that allocates the higher level of force wins. The payoff of the game is the proportion of wins on the individual battlefields. An equilibrium of the Colonel Blotto game is a pair of n-variate distributions. This paper characterizes the unique equilibrium payoffs for all (symmetric and asymmetric) configurations of the players’ aggregate levels of force, characterizes the complete set of equilibrium univariate marginal distributions for most of these configurations, and constructs entirely new and novel equilibrium n-variate distributions.I am grateful to Jason Abrevaya, Dan Kovenock, James C. Moore, Roger B. Nelsen, and three anonymous referees for very helpful comments. A version of this paper was presented at the 2005 Midwest Economic Theory Meetings. This paper is based on the first chapter of my Ph.D. dissertation     

A game of timing and visibility

We consider the following abstraction of competing publications. There are n players in the game. Each player i chooses a point x_i in the interval [0,1], and a player's payoff is the distance from its point x_i to the next larger point, or to 1 if x_i is the largest. For this game, we give a complete characterization of the Nash equilibrium for the two-player game, and, more important, we give an efficient approximation algorithm to compute numerically the symmetric Nash equilibrium for the n-player game. The approximation is computed via a discrete version of the game. In both cases, we show that the (symmetric) equilibrium is unique. Our algorithmic approach to the n-player game is non-standard in that it does not involve solving a system of differential equations. We believe that our techniques can be useful in the analysis of other timing games.     

A note on asymmetric and mixed strategy equilibria in the search-theoretic model of fiat money

Summary. The simple search-theoretic model of fiat money has three symmetric Nash equilibria: all agents accept money with probability 1; all agents accept money with probability 0; and all agents accept money with probability y in (0,1). Here I construct an asymmetric pure strategy equilibrium, payoff-equivalent to the symmetric mixed strategy equilibrium, where a fraction N in (0,1) of agents always accept money and 1-N never accept money. Counter to what has been conjectured previously, I find N > y. I also introduce evolutionary dynamics, and show that the economy converges to monetary exchange iff the initial proportion of agents accepting money exceeds N. Received: September 10, 1997; revised version: April 24, 1998     

Noncooperative foundations of the nucleolus in majority games

This paper studies coalition formation, payoff division and expected payoffs in a “divide the dollar by majority rule” game with random proposers. A power index is called self-confirming if it can be obtained as an equilibrium of the game using the index itself as probability vector. Unlike the Shapley value and other commonly used power indices, the nucleolus has this property. The proof uses a weak version of Kohlberg's [SIAM J. Appl. Math. 20 (1971) 62] balancedness result reinterpreting the balancing weights as probabilities in a mixed strategy equilibrium.     

A Laboratory Investigation of Multiperson Rationality and Presentation Effects

This paper reports the results of laboratory experiments in which subjects were presented with different two-person decision problems in both their extensive and normal forms. All games generated the same equilibrium outcomes. Our results indicate that the presentation of the decision problem significantly affects the strategy chosen. Surprisingly, these presentation effects were most prominent in the simplest games where differences in presentation would seem most transparent. It appears that subjects are much more likely to use (and fear) incredible threats when the problem is presented as a one-stage rather than as a multistage game. Journal of Economic Literature Classification Numbers: 026,215.     

Stochastic stability in a double auction

In a k-double auction, a buyer and a seller must simultaneously announce a bid and an ask price respectively. Exchange of the indivisible good takes place if and only if the bid is at least as high as the ask, the trading price being the bid price with probability k and the ask price with probability (1−k). We show that the stable equilibria of a complete information k-double approximate an asymmetric Nash bargaining solution with the seller's bargaining power decreasing in k.Note that ceteris paribus, the payoffs of the seller of the one-shot game increase in k. Nevertheless, as the stochastically stable equilibrium price decreases in k, choosing the seller's favorite price with a relatively higher probability in individual encounters makes him worse off in the long run.     

Sequential auctions with imperfect quantity commitment

This paper studies sequential second price auctions with imperfect quantity commitment in environments involving single-unit demands, independent private values, and non-decreasing marginal costs. The paper characterizes the symmetric equilibrium strategy and demonstrates that the equilibrium price sequence is conditionally non-increasing, showing a downwards drift in cases in which the marginal cost exceeds the reserve price with positive probability. The paper also argues that unlike a strong seller who sets reserve prices strictly above marginal costs, a weak seller will typically prefer to commit to such inefficiently low reserve prices.     

How Proper Is Sequential Equilibrium?

A strategy profile of a normal form game is proper if and only if it is quasi-perfect in every extensive form (with that normal form). Thus, properness requires optimality along a sequence of supporting trembles, while sequentiality only requires optimality in the limit. A decision-theoretic implementation of sequential rationality, strategic independence respecting equilibrium (SIRE), is defined and compared to proper equilibrium, using lexicographic probability systems. Finally, we give tremble-based characterizations, which do not involve structural features of the game, of the rankings of strategies that underlie proper equilibrium and SIRE.Journal of Economic LiteratureClassification Numbers: C70, C72.     

Legislative Bargaining and Coalition Formation

The finite horizon version of D. P. Baron and J. Ferejohn's [1989, Amer. Polit. Sci. Rev.83, 1181-1206] legislative bargaining model is investigated. With three or more periods, a continuum of divisions is supportable as subgame perfect equilib- ria. There exist equilibria where coalitions larger than a minimal winning coalition receive strictly positive shares. With sufficiently patient players and a sufficiently long horizon, any interior distribution is supportable as an equilibrium. In contrast, a generic uniqueness result applies when introducing heterogenous time preferences. The unique backwards induction equilibrium in the perturbed game is nonstationary, and neither the original (symmetric) nor the perturbed game provides guidance for equilibrium selection in the infinite game. Journal of Economic Literature Classification Numbers: C73, C78, D72, D78, H49.     

On the Coalition-Proofness of the Pareto Frontier of the Set of Nash Equilibria

This article shows that the Pareto efficient frontier of the Nash equilibrium set of games with strategic substitutes is coalition-proof under the following conditions: (1) the game has three players, or, alternatively, a player's payoff depends on her own strategy and on the sum (but not on the composition) of other players' strategies; (2) an increase in a player's strategy either raises all other players' payoffs monotonically or reduces them monotonically; and (3) each player's payoff is strictly concave in her own strategy. Under these conditions, the Pareto dominance refinement is equivalent to the coalition-proof Nash equilibrium refinement.Journal of Economic LiteratureClassification Number: C72.     

Reputation with observed actions

Summary A single long-run player plays a fixed stage game (simultaneous orsequential move) against an infinite sequence of short-run opponents that play only once but can observe all past realized actions. Assuming that the probability distributions over types of long and short-run players have full support, we show that the long-run player can always establish a reputation for theStackelberg strategy and is therefore guaranteed almost his Stackelberg payoff in all Nash equilibria of the repeated game.The financial support of the National Science Foundation, Grant SES 90-7999, and of Consiglio Nazionale delle Ricerche is gratefully acknowledged. I wish to thank David Levine, Wolfgang Pesendorfer and Seminar Participants at UCLA, Universidad Carlos III de Madrid and University of Naples for useful discussions and suggestions.