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.     

Better-reply dynamics and global convergence to Nash equilibrium in aggregative games

We consider n-person games with quasi-concave payoffs that depend on a player's own action and the sum of all players' actions. We show that a discrete-time, stochastic process in which players move towards better replies—the better-reply dynamics—converges globally to a Nash equilibrium if actions are either strategic substitutes or strategic complements for all players around each Nash equilibrium that is asymptotically stable under a deterministic, adjusted best-reply dynamics. We present an example of a 2-person game with a unique equilibrium where the derivatives of the best-reply functions have different signs and the better-reply dynamics does not converge.     

Uniqueness of Stationary Equilibrium Payoffs in the Baron-Ferejohn Model

We consider a multilateral sequential bargaining model in which the players may differ in their probability of being selected as the proposer and the rate at which they discount future payoffs. For games in which agreement requires less than unanimous consent, we characterize the set of stationary subgame perfect equilibrium payoffs. With this characterization, we establish the uniqueness of the equilibrium payoffs. For the case where the players have the same discount factor, we show that the payoff to a player is nondecreasing in his probability of being selected as the proposer. For the case where the players have the same probability of being selected as the proposer, we show that the payoff to a player is nondecreasing in his discount factor. Journal of Economic Literature Classification numbers: C72, C78, D70.     

Strategic step-by-step negotiation

We analyze a specific type of negotiation process where parties proceed in stages taking into consideration that negotiation may end prematurely with an inefficient agreement. Parties negotiate only one increasing pie, thereby avoiding inefficiencies which are typical for issue-by-issue negotiations. For ann-stage game, we prove the existence of a unique subgame-perfect equilibrium. We then show that step-by-step negotiation can only improve players' expected payoffs if negotiation in stages reduces the difference between their equilibrium offers. For this to occur, however, the risk of negotiation must be affected by the agenda of the bargaining problem.     

Bubble-free policy feedback rules

We consider a broad class of linear dynamic stochastic rational-expectations models made of a finite number N of structural equations for N+1 endogenous variables and to be closed by one policy feedback rule. We design, for any model of this class and any stationary VARMA solution of that model, a “bubble-free” policy feedback rule ensuring that this solution is not only the unique stationary solution of the closed model, but also its unique solution. We apply these results to locally linearisable models of the monetary transmission mechanism and obtain interest-rate rules that not only ensure the local determinacy of the targeted equilibrium in the neighbourhood of the steady state considered, but also prevent the economy from gradually leaving this neighbourhood.     

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     

Economies with Land—A Game Theoretical Approach

With an economy with land (an economy of Debreu-type in which land is the unique commodity) we associate a cooperative game with transferable utility v . The set of all TU-games of type v is investigated and the set of equilibrium payoffs (in the TU-sense) of the economy is described as a subset of the core of v . We prove that equilibrium payoffs can be extended to population monotonic allocation schemes in the sense of Sprumont.     

Evolutionary Stability in the Finitely Repeated Prisoner 's Dilemma Game

The dynamic evolutionary stability of mutual defection is proven for the repeated prisoner 's dilemma game where payoffs are cumulative and the number of repetitions is known. This agrees with the classical result that the only Nash equilibrium outcome is to defect at all stages of this repeated game. Moreover, it is shown that, for any initial polymorphic population, the evolutionary dynamic converges to a unique Nash equilibrium strategy that depends on the original polymorphism. Both these results confirm earlier conjectures concerning the application of evolutionary game theory to the repeated prisoner 's dilemma.Journal of Economic LiteratureClassification Numbers: C70, C72.     

Efficient delays in a stochastic model of bargaining

Summary. We consider a k-player sequential bargaining model in which both the cake size and the identity of the proposer are determined by a stochastic process. For the case where the cake is a simplex (of random size) and the players share a common discount factor, we establish the existence of a unique stationary subgame perfect payoff which is efficient and characterize the conditions under which agreement is delayed. We also investigate how the equilibrium payoffs depend on the order in which the players move and on the correlation between the identity of the proposer and the cake size.Received: November 5, 1996; revised version: December 31, 1996This revised version was published online in February 2005 with corrections to the cover date.     

Electoral competition with privately-informed candidates

This paper formulates and analyzes a general model of elections in which candidates receive private signals about voters' preferences prior to committing to political platforms. We fully characterize the unique pure-strategy equilibrium: After receiving her signal, each candidate locates at the median of the distribution of the median voter's location, conditional on the other candidate receiving the same signal. Sufficient conditions for the existence of pure strategy equilibrium are provided. Though the electoral game exhibits discontinuous payoffs for the candidates, we prove that mixed strategy equilibria exist generally, that equilibrium expected payoffs are continuous in the parameters of the model, and that mixed strategy equilibria are upper hemicontinuous. This allows us to study the robustness of the median voter theorem to private information: Pure strategy equilibria may fail to exist in models “close” to the Downsian model, but mixed strategy equilibria must, and they will be “close” to the Downsian equilibrium.     

Preemption in a real option game with a first mover advantage and player-specific uncertainty

In this paper a two-player real option game with a first-mover advantage is analyzed, where payoffs are driven by a player-specific stochastic state variable. It is shown that there exists an equilibrium which has qualitatively different properties from those in standard real option games driven by common stochastic shocks. The properties of the equilibrium are four-fold: (i) preemption does not necessarily occur, (ii) if preemption takes place, the rent-equalization property holds, (iii) for almost all sample paths it is clear ex-ante which player invests first, and (iv) it is possible that both players invest simultaneously, even if that is not optimal. It is argued from simulations that real option games with a common one-dimensional shock do not provide a good approximation for games with player-specific uncertainty, even if these are highly correlated.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

Strategic Buyers and Privately Observed Prices

A model of finitely repeated price competition between two sellers with differentiated goods and a large buyer is analyzed. The set of pure strategy sequential equilibria is investigated under public and private monitoring. With private monitoring, i.e., when prices are not observable to the competing sellers, all sales are made by the better seller and the set of repeated game equilibrium payoffs coincides with the stage game subgame perfect equilibrium payoffs. This is in sharp contrast to the game with perfect monitoring where the folk theorem obtains. Journal of Economic Literature Classification Numbers: C72, D43.     

Group efforts when performance is determined by the “best shot”

We investigate the private provision of a public good whose level is determined by the maximum effort made by a group member. Costs of effort are either commonly known or privately known. For symmetric perfect-information games, any number of players may be active and we characterize the unique (mixed-strategy) equilibrium in which active contributors use the same strategy. Increasing the number of active players leads to stochastically lower individual efforts and level of the public good. When information is private, the symmetric equilibrium is in pure strategies. Increasing the number of players yields a pointwise reduction in the equilibrium contribution strategy but an increase in equilibrium payoffs. Comparative statics with respect to costs and levels of risk aversion are derived. Finally, whether information is public or private, equilibria are inefficient—we provide mechanisms that improve efficiency.     

Coalition formation as a dynamic process

We study coalition formation as an ongoing, dynamic process, with payoffs generated as coalitions form, disintegrate, or regroup. A process of coalition formation (PCF) is an equilibrium if a coalitional move to some other state can be “justified” by the expectation of higher future value, compared to inaction. This future value, in turn, is endogenous: it depends on coalitional movements at each node. We study existence of equilibrium PCFs. We connect deterministic equilibrium PCFs with unique absorbing state to the core, and equilibrium PCFs with multiple absorbing states to the largest consistent set. In addition, we study cyclical as well as stochastic equilibrium PCFs.     

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.      

Coalition Formation and Potential Games

In this paper we study the formation of coalition structures in situations described by a cooperative game. Players choose independently which coalition they want to join. The payoffs to the players are determined by an allocation rule on the underlying game and the coalition structure that results from the strategies of the players according to some formation rule. We study two well-known coalition structure formation rules and show that for both formation rules there exists a unique component-efficient allocation rule that results in a potential game. Journal of Economic Literature Classification Numbers: C71, C72.     

Regularity of pure strategy equilibrium points in a class of bargaining games

Summary. We develop an index theory for the Stationary Subgame Perfect (SSP) equilibrium set in a class of n-player sequential bargaining games with probabilistic recognition rules. For games with oligarchic voting rules (a class that includes unanimity rule), we establish conditions on individual utilities that ensure that for almost all discount factors, the number of SSP equilibria is odd and the equilibrium correspondence lower-hemicontinuous. For games with general, monotonic voting rules, we show generic (in discount factors) determinacy of SSP equilibria under the restriction that the agreement space is of dimension one. For non-oligarchic voting rules and agreement spaces of higher finite dimension, we establish generic determinacy for the subset of SSP equilibria in pure strategies. The analysis also extends to the case of fixed delay costs. Lastly, we provide a sufficient condition for uniqueness of SSP equilibrium in oligarchic games.Received: 13 May 2004, Revised: 1 March 2005, JEL Classification Numbers: C62, C72, C78.I thank John Duggan and participants of the 2003 annual meeting of the American Political Science Association, Philadelphia, PA, the Political Economy Seminar at Northwestern University, and the Economic Theory seminar at the University of Rochester for helpful comments.     

Repeated games with one-memory

We study the extent to which equilibrium payoffs of discounted repeated games can be obtained by 1-memory strategies. We establish the following in games with perfect (rich) action spaces: First, when the players are sufficiently patient, the subgame perfect Folk Theorem holds with 1-memory. Second, for arbitrary level of discounting, all strictly enforceable subgame perfect equilibrium payoffs can be approximately supported with 1-memory if the number of players exceeds two. Furthermore, in this case all subgame perfect equilibrium payoffs can be approximately supported by an ε-equilibrium with 1-memory. In two-player games, the same set of results hold if an additional restriction is assumed: Players must have common punishments. Finally, to illustrate the role of our assumptions, we present robust examples of games in which there is a subgame perfect equilibrium payoff profile that cannot be obtained with 1-memory. Thus, our results are the best that can be hoped for.     

An Evolutionary Interpretation of Mixed-Strategy Equilibria

A convincing interpretation of mixed-strategy equilibria describes them as steady states in a large population in which players use pure strategies but the population as a whole mimics a mixed strategy. I study the conditions under which an evolutionary, stochastic learning process converges to the appropriate distribution over pure strategies in the population. I find that not all mixed equilibria can be justified as the result of an evolutionary process even if the equilibrium is unique. For symmetric 2 × 2 and 3 × 3 games I give necessary and sufficient conditions for convergence, which are related to the concept of an ESS, and forn × ngames I give a sufficient condition.Journal of Economic LiteratureClassification Numbers: C73, D83.