Strategic delay and endogenous offers in bargaining games with private information

This paperendogenously determines the order of offers and the duration of delay in reaching agreement between buyers and sellers in a continuous-time bargaining game in which a seller wishes to vend an object of known cost to a buyer, to whom the value of the good is private information, and in which each player can choose to strategically delay a response to a previous offer or to interrupt the delay of his rival. Both buyers and sellers are shown to prefer to move first in a model of bargaining in which: (1) either player can make the first offer; (2) after the minimum time has elapsed from the previous offer, either player can make an offer; and (3) players can choose to strategically delay and refrain from making an offer after the previous offer. When the buyer moves first, the equilibrium response for the seller is to accept the offer immediately. When the seller moves first the equilibrium is characterized by the seller making all but the last offer, with minimal feasible delay between successive offers. Observable endogenous delay in reaching an agreement in such equilibria approaches zero as the minimal feasible delay between offers approaches zero. This indicates that in noncooperative bargaining models with private information, where players can strategically delay their offers, endogenizing the order in which players make offers removes the ability of informational asymmetries to generate equilibria exhibiting endogenous delay in reaching an agreement.     

Bayesian learning and convergence to Nash equilibria without common priors

Summary. Consider an infinitely repeated game where each player is characterized by a “type” which may be unknown to the other players in the game. Suppose further that each player's belief about others is independent of that player's type. Impose an absolute continuity condition on the ex ante beliefs of players (weaker than mutual absolute continuity). Then any limit point of beliefs of players about the future of the game conditional on the past lies in the set of Nash or Subjective equilibria. Our assumption does not require common priors so is weaker than Jordan (1991); however our conclusion is weaker, we obtain convergence to subjective and not necessarily Nash equilibria. Our model is a generalization of the Kalai and Lehrer (1993) model. Our assumption is weaker than theirs. However, our conclusion is also weaker, and shows that limit points of beliefs, and not actual play, are subjective equilibria. Received: March 3, 1995; revised version: February 17, 1997     

Unmediated communication in games with complete and incomplete information

We study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^U(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available and players exchange private or public messages that do not affect directly their payoffs. We first show that if G is a game of complete information with five or more players and rational parameters, then S^U(G) coincides with the set of correlated equilibria of G. Next, we demonstrate that if G is a game of incomplete information with at least five players, rational parameters and full support (i.e., all profiles of types have positive probability), then S^U(G) is equal to the set of communication equilibria of G.     

Convex Games and Stable Sets

It is well known that the core of a convex coalitional game with a finite set of players is the unique von Neumann–Morgenstern stable set of the game. We extend the definition of a stable set to coalitional games with an infinite set of players and give an example of a convex simple game with a countable set of players which does not have a stable set. But if a convex game with a countable set of players is continuous at the grand coalition, we prove that its core is the unique von Neumann–Morgenstern stable set. We also show that a game with a countable (possibly finite) set of players which is inner continuous is convex iff the core of each of its subgames is a stable set.Journal of Economic LiteratureClassification Numbers: C70, C71.     

Ex ante contracting with endogenously determined communication plans

Summary. In this paper we introduce a new model of ex ante contracting for economies with asymmetric information to examine endogenously determined communication plans for information sharing in the interim stage. In contrast to the models used in previous research, in the present model agents negotiate not only on a contract of state contingent allocations but also on a communication plan, a set of rules describing how agents will reveal part of their private information at the interim stage to execute the trade contracts. We prove a result about the nested structure of the set of allocations implementable by various communication plans and establish the existence of core strategies for this cooperative game under various regularity conditions. Received: 4 March 1998; revised version: 17 September 1999     

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.     

Reciprocal relationships and mechanism design

We study an incomplete information game in which players can coordinate their actions by contracting among themselves. We model this relationship as a reciprocal contracting procedure where each player has the ability to make commitments contingent on the other players' commitments. We differ from the rest of the literature on reciprocal contracting by assuming that punishments cannot be enforced in the event that cooperation breaks down. We fully characterize the outcomes that can be supported as perfect Bayesian equilibrium outcomes in such an environment. We use our characterization to show that the set of supportable outcomes with reciprocal contracting is larger than the set of outcomes available in a centralized mechanism design environment in which the mechanism designer is constrained by his inability to enforce punishments against non‐participants. The difference stems from the players' ability in our contracting game to convey partial information about their types at the time they offer contracts. We discuss the implications of our analysis for modelling collusion between multiple agents interacting with the same principal.     

On the Least Core and the Mas-Colell Bargaining Set

We show that the least core of a TU coalitional game with a finite set of players is contained in the Mas-Colell bargaining set. This result is extended to games with a measurable space of players in which the worth of the grand coalition is at least that of any other coalition in the game. As a consequence, we obtain an existence theorem for the Mas-Colell bargaining set in TU games with a measurable space of players. Journal of Economic Literature Classification Number: C71.     

Reallocation and learning over the business cycle

This paper shows how cyclical aggregate shocks can stimulate structural reallocation activities, which in turn amplify the effect of the shock. It analyses the informational aspects of restructuring activities and their interplay with aggregate shocks. A model is developed in which production units are uncertain about the value of staying in the market and learn about it over time in a Bayesian fashion. In addition to their own private assessment, they can also learn from observing other units’ decisions. Given that adjusting is costly, each unit has an incentive to delay action and wait for other players to act in order to make a better informed decision. If delay is more costly in a downturn, a negative aggregate shock can break the inertia and induce the most pessimistic agents to exit. The information released by such actions will induce more action, thus generating a burst in restructuring activities that reinforces the initial effect of the aggregate shock. This process of information accumulation and revelation offers both a powerful amplification mechanism of relatively modest aggregate shocks and a potential explanation of why restructuring tends to be concentrated in recessions.     

Screening in a Matching Market

Contract design under incomplete information is often analysed in a bilaterally monopolistic setting. If the informed party's reservation value does not depend on its private information (its type), it is a standard result that the uninformed side offers "low" types distorted contracts to reduce the information rent left to "high7rdquo; types.
We challenge this result by embedding contract design in a matching market environment. We consider a market where players meet pairwise and where, in each match, either side may be chosen to make a take-it-or-leave-it offer. As frictions become sufficiently low, we find that the set of equilibria is independent of whether there is complete or incomplete information. In particular, all contracts are free of distortions.     

Analogy-based expectation equilibrium

In complex situations, agents use simplified representations to learn how their environment may react. I assume that agents bundle nodes at which other agents must move into analogy classes, and agents only try to learn the average behavior in every class. Specifically, I propose a new solution concept for multi-stage games with perfect information: at every node players choose best-responses to their analogy-based expectations, and expectations correctly represent the average behavior in every class. The solution concept is shown to differ from existing concepts, and it is applied to a variety of games, in particular the centipede game, and ultimatum/bargaining games. The approach explains in a new way why players may Pass for a large number of periods in the centipede game, and why the responder need not be stuck to his reservation value in ultimatum games. Some possible avenues for endogenizing the analogy grouping are also suggested.     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

A “Super” Folk Theorem for dynastic repeated games

We analyze dynastic repeated games. These are repeated games in which the stage game is played by successive generations of finitely-lived players with dynastic preferences. Each individual has preferences that replicate those of the infinitely-lived players of a standard discounted infinitely-repeated game. Individuals live one period and do not observe the history of play that takes place before their birth, but instead create social memory through private messages received from their immediate predecessors. Under mild conditions, when players are sufficiently patient, all feasible payoff vectors (including those below the minmax of the stage game) can be sustained by sequential equilibria of the dynastic repeated game with private communication. In particular, the result applies to any stage game with n  ≥  4 players for which the standard Folk Theorem yields a payoff set with a non-empty interior. We are also able to characterize fully the conditions under which a sequential equilibrium of the dynastic repeated game can yield a payoff vector not sustainable as a subgame perfect equilibrium of the standard repeated game. For this to be the case it must be that the players’ equilibrium beliefs violate a condition that we term “inter-generational agreement.” A previous version of this paper was circulated as Anderlini et al. (2005). We are grateful to Jeff Ely, Leonardo Felli, Navin Kartik, David Levine, Stephen Morris, Michele Piccione, Andrew Postlewaite, Lones Smith and to seminar audiences at Bocconi, Cambridge, CEPR-Guerzensee, Chicago, Columbia, Edinburgh, Essex, Georgetown, Leicester, LSE, Northwestern, Oxford, Rome (La Sapienza), Rutgers, SAET-Vigo, Stanford, SUNY-Albany, UCL, UC-San Diego, Venice and Yale for helpful feedback.     

Delay and information aggregation in stopping games with private information

We consider equilibrium timing decisions in a model with a large number of players and informational externalities. The players have private information about a common payoff parameter that determines the optimal time to invest. They learn from each other in real time by observing past investment decisions. We develop new methods of analysis for such large games, and we give a full characterization of symmetric equilibria. We show that the equilibrium statistical inferences are based on an exponential learning model. Although the beliefs converge to truth, learning takes place too late. Ex-ante welfare is strictly between that without observational learning and that with full information.     

INCOMPLETE INFORMATION GAMES WITH MULTIPLE PRIORS*

We present a model of incomplete information games, where each player is endowed with a set of priors. Upon arrival of private information, it is assumed that each player “updates” his set of priors to a set of posterior beliefs, and then evaluates his actions by the most pessimistic posterior beliefs. So each player's preferences may exhibit aversion to ambiguity or uncertainty. We define a couple of equilibrium concepts, establish existence results for them, and demonstrate by examples how players’ views on uncertainty about the environment affect the strategic outcomes.     

On Sustaining Cooperation without Public Observations

This paper examines a dynamic game in which each player only observes a private and imperfect signal on the actions played. Our main result is that in a repeated prisoner's dilemma where defections are irreversible (at least for a long enough period of time), patient enough players may achieve almost efficient outcomes. Dealing with models of imperfect private monitoring is difficult because (i) continuation games are games of incomplete information, hence they do not have the same structure as the original game. In particular, continuation equilibria are correlated equilibria. (ii) Players are typically uncertain about their opponents' past observations and actions, and they use their entire own private history to learn about these actions. As a result equilibrium strategies are in general nontrivial and increasingly complex functions of past observations. We bypass these difficulties by looking at correlated equilibria of the original game and find correlated equilibria in which the decision problem faced by each player remains the same over time. Journal of Economic Literature Classification Numbers: C72.     

Contract renegotiation in a continuous state space

Summary. When players are unable to write complete state contingent contracts it is shown, within the context of a non-cooperative contracting-renegotiation game, that the only subgame perfect equilibrium allocations are those that correspond to the set of first-best allocations. Players are able to implement this set of allocations by signing an initial contract that is subsequently renegotiated in all states of the world. The contracting-renegotiation problem is complicated in an interesting way by assuming that the state space is continuous. The issue of the existence of an initial contract, that is subsequently renegotiated to the set of first-best allocations, must be resolved. Unlike Aghion, Dewatripont and Rey [1994], the results here do not require nor depend upon the comonotonicity of the objective functions. Received: January 27, 1995; revised version July 1, 1996     

Strategic approximations of discontinuous games

An infinite game is approximated by restricting the players to finite subsets of their pure strategy spaces. A strategic approximationof an infinite game is a countable subset of pure strategies with the property that limits of all equilibria of all sequences of approximating games whose finite strategy sets eventually include each member of the countable set must be equilibria of the infinite game. We provide conditions under which infinite games admit strategic approximations.     

How Much Common Belief Is Necessary for a Convention?

We study Bayesian coordination games in which players choose actions conditional on the realization of their respective signals. Due to differential information, the players do not have common knowledge that a particular game is being played. However, they do have common beliefs with specified probabilities concerning their environment. In our framework, any equilibrium set of rules must be simple enough so that the actions of all players are common belief with probability 1 at every state. Common belief with probability close to 1 will not do.Journal of Economic LiteratureClassification Numbers: C72, D82.     

Speculative Attacks with Multiple Sources of Public Information*

We propose a speculative attack model in which agents receive multiple public signals. Diverse pieces of public information can be taken into account differently by different players and are likely to lead to different appreciations ex post. This process defines players' expected private values of a successful attack. The main result shows that equilibrium uniqueness depends on two conditions: (i) signals are sufficiently dispersed and (ii) private beliefs about signals' relative precision differ sufficiently. We derive some implications for information dissemination policy. Transparency in this context is multidimensional: it concerns the publicity of announcements, the number of signals disclosed and their precision.