Dynamic common agency

A general model of dynamic common agency with symmetric information is considered. The set of truthful Markov perfect equilibrium payoffs is characterized and the efficiency properties of the equilibria are established. A condition for the uniqueness of equilibrium payoffs is derived for the static and the dynamic game. The payoff is unique if and only if the payoff of each principal coincides with his marginal contribution to the social value of the game. The dynamic model is applied to a game of agenda setting.     

Trading with a common agent under complete information: A characterization of Nash equilibria

We analyze an abstract model of trading where N principals submit quantity-payment schedules that describe the contracts they offer to an agent, and the agent then chooses how much to trade with every principal. This represents a special class of common agency games with complete information. We study all the subgame perfect Nash equilibria of these games, not only truthful ones, providing a complete characterization of equilibrium payoffs. In particular, we show that the equilibrium that is Pareto-dominant for the principals is not truthful when there are more than two of them. We also provide a partial characterization of equilibrium strategies.     

The set of sunspot equilibria in economies with incomplete financial markets: variable asset prices

Summary. I consider the set of equilibria of two-period economies with S extrinsic states of nature in the second period and I assets with linearly independent nominal payoffs. Asset prices are variable. If the number of agents is greater than (S-I), the payoff matrix is in general position and S 2I, the set of equilibrium allocations generically (in utility function space) contains a smooth manifold of dimension (S-1). Moreover, the map from states o f nature to equilibrium allocations (restricted to this manifold) is one-to-one at each equilibrium. Received: February 23, 1998; revised version: June 1, 2000     

Communication equilibrium payoffs in repeated games with imperfect monitoring

We characterize the set of communication equilibrium payoffs of any undiscounted repeated matrix-game with imperfect monitoring and complete information. For two-player games, a characterization is provided by Mertens, Sorin, and Zamir (Repeated games, Part A (1994) CORE DP 9420), mainly using Lehrer's (Math. Operations Res. (1992) 175) result for correlated equilibria. The main result of this paper is to extend this characterization to the n-player case. The proof of the characterization relies on an analogy with an auxiliary 2-player repeated game with incomplete information and imperfect monitoring. We use Kohlberg's (Int. J. Game Theory (1975) 7) result to construct explicitly a canonical communication device for each communication equilibrium payoff.     

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.     

How sensitive are bargaining outcomes to changes in disagreement payoffs?

We use a human-subjects experiment to investigate how bargaining outcomes are affected by changes in bargainers’ disagreement payoffs. Subjects bargain against changing opponents, with randomly drawn asymmetric disagreement outcomes that vary over plays of the game, and with complete information about disagreement payoffs and the cake size. We find that subjects only respond about half as much as theoretically predicted to changes in their own disagreement payoff and to changes in their opponent’s disagreement payoff. This effect is observed in a standard Nash demand game and a related unstructured bargaining game, in both early and late rounds, and is robust to moderate changes in stake sizes. We show theoretically that standard models of expected utility maximisation are unable to account for this under-responsiveness, even when generalised to allow for risk aversion. We also show that quantal-response equilibrium has, at best, mixed success in characterising our results. However, a simple model of other-regarding preferences can explain our main results.     

Efficiency and stability of sampling equilibrium in public goods games

Most models of social preferences and bounded rationality that are effective in explaining efficiency‐increasing departures from equilibrium behavior cannot easily account for similar deviations when they are efficiency‐reducing. We show that the notion of sampling equilibrium, subject to a suitable stability refinement, can account for behavior in both efficiency‐enhancing and efficiency‐reducing conditions. In particular, in public goods games with dominant strategy equilibria, stable sampling equilibrium can involve the play of dominated strategies with positive probability both when such behavior increases aggregate payoffs (relative to the standard prediction) and when it reduces aggregate payoffs. The dominant strategy equilibrium prediction changes abruptly from zero contribution to full contribution as a parameter crosses a threshold, whereas the stable sampling equilibrium remains fully mixed throughout. This is consistent with the available experimental evidence.     

Evolution of Interdependent Preferences in Aggregative Games

We study the evolution of preference interdependence in aggregative games which are symmetric with respect to material payoffs but asymmetric with respect to player objective functions. We identify a class of aggregative games whose equilibria have the property that the players with interdependent preferences (who care not only about their own material payoffs but also about their payoffs relative to others) earn strictly higher material payoffs than do the material payoff maximizers. Implications of this finding for the theory of preference evolution are discussed. Journal of Economic Literature Classification Numbers: C72, D62.     

Essential equilibria in normal-form games

A Nash equilibrium x of a normal-form game G is essential if any perturbation of G has an equilibrium close to x. Using payoff perturbations, we show that for games that are generic in the set of compact, quasiconcave, and generalized payoff secure games with upper semicontinuous sum of payoffs, all equilibria are essential. Some variants of this result are also established.     

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.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.     

Robustness to strategic uncertainty

We introduce a criterion for robustness to strategic uncertainty in games with continuum strategy sets. We model a player's uncertainty about another player's strategy as an atomless probability distribution over that player's strategy set. We call a strategy profile robust to strategic uncertainty if it is the limit, as uncertainty vanishes, of some sequence of strategy profiles in which every player's strategy is optimal under his or her uncertainty about the others. When payoff functions are continuous we show that our criterion is a refinement of Nash equilibrium and we also give sufficient conditions for existence of a robust strategy profile. In addition, we apply the criterion to Bertrand games with convex costs, a class of games with discontinuous payoff functions and a continuum of Nash equilibria. We show that it then selects a unique Nash equilibrium, in agreement with some recent experimental findings.     

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.     

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.     

Bertrand Games and Sharing Rules

We consider asymmetric Bertrand games with arbitrary payoffs at ties or sharing rules, and identify sufficient conditions for the zero-profit outcome and the existence of Nash equilibria. Subject to some technical conditions on non-tied payoffs the following hold. If the sharing rule is strictly tie-decreasing all players but one receive zero equilibrium payoffs, while everybody does so if non-tied payoffs are symmetric. Mixed (pure) strategy Nash equilibria exist if the sharing rule is (norm) tie-decreasing and coalition-monotone. I would like to thank Fernando Branco, the audience at Pompeu Fabra (Barcelona), ISEG (Lisbon), University of Mannheim, ESEM 2003 (Venice), EARIE 2005 (Porto), two anonymous referees, and the editor Dan Kovenock for very useful comments. This research received financial support under project POCTI/ECO/37925/2001 of FCT and FEDER.     

Effort and performance in group contests

We study contest performance by focusing on the per capita payoffs of the contestants in an important class of asymmetric two-group contests. The group with the higher valuation has a greater chance of winning the contest whenever the rent-seeking technology is increasing and concave. We note that equilibrium efforts and payoffs per capita are uniquely defined and can be subjected to a comparative statics analysis. We show that payoff per capita for a group increases with its own valuation but decreases with the valuation of the opposing group. Per capita payoff for a group increases with its population.     

On the folk theorem with one-dimensional payoffs and different discount factors

Proving the folk theorem in a game with three or more players usually requires imposing restrictions on the dimensionality of the stage-game payoffs. Fudenberg and Maskin (1986) assume full dimensionality of payoffs, while Abreu et al. (1994) assume the weaker NEU condition (“nonequivalent utilities”). In this note, we consider a class of n-player games where each player receives the same stage-game payoff, either zero or one. The stage-game payoffs therefore constitute a one-dimensional set, violating NEU. We show that if all players have different discount factors, then for discount factors sufficiently close to one, any strictly individually rational payoff profile can be obtained as the outcome of a subgame-perfect equilibrium with public correlation.     

Trade and revelation of information

We consider an economy with asymmetric information and two types of agents, fully informed and uninformed. Uninformed agents update their information observing equilibrium prices and the equilibrium levels of other agents’ excess demand. We show that, for a generic set of economies, there are rational expectations equilibria which are partially revealing on an open, dense set of signals of positive Lebesgue measure, provided that the dimension of the signal space is sufficiently larger than the dimension of the commodity space.     

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.     

On the endogeneity of Cournot-Nash and Stackelberg equilibria: games of accumulation

We characterize equilibria of games with two properties: (i) Agents have the opportunity to adjust their strategic variable after their initial choices and before payoffs occur; but (ii) they can only add to their initial amounts. The equilibrium set consists of just the Cournot-Nash outcome, one or both Stackelberg outcomes, or a continuum of points including the Cournot-Nash outcome and one or both Stackelberg outcomes. A simple theorem that uses agents’ standard one-period reaction functions and the one-period Cournot-Nash and Stackelberg equilibria delineates the equilibrium set. Applications include contribution, oligopoly, and rent-seeking games.