We consider the efficient allocation of a single good with interdependent values in a quasi-linear environment. We present an approach to modelling interdependent preferences distinguishing between “payoff types” and “belief types” and report a characterization of when the efficient allocation can be partially Bayesian implemented on a finite type space. The characterization can be used to unify a number of sufficient conditions for efficient partial implementation in this classical auction setting.
We report how a canonical language for discussing interdependent types — developed in a more general setting by Bergemann, Morris and Takahashi (2011) — applies in this setting and note by example that this canonical language will not allow us to distinguish some types in the payoff type — belief type language.
We consider the optimal design of flexible use in a digital-rights-management policy for a digital good subject to piracy. Consumers can acquire the digital good either as a licensed product or as an unlicensed copy. The ease of access to unlicensed copies is increasing in the flexibility accorded to licensed copies. The content provider has to trade off consumers’ valuation of a licensed copy against the sales lost to piracy.
We enrich the basic model by introducing a “secure platform” that is required to use the digital good. We show that the platform allows for the socially optimal provision of flexibility for the digital good but only if both are sold by an integrated firm.
The set of outcomes that can arise in Bayes Nash equilibria of an incomplete information game where players may or may not have access to more private information is characterized and shown to be equivalent to the set of an incomplete information version of correlated equilibrium, which we call Bayes correlated equilibrium. We describe a partial order on many player information structures — which we call individual sufficiency — under which more information shrinks the set of Bayes correlated equilibria. We discuss the relation of the solution concept to alternative definitions of correlated equilibrium in incomplete information games and of the partial order on information structures to others, including Blackwell’s for the single player case.
We define a notion of correlated equilibrium for games with incomplete information in a general setting with finite players, finite actions, and finite states, which we call Bayes correlated equilibrium. The set of Bayes correlated equilibria of a fixed incomplete information game equals the set of probability distributions over actions, states and types that might arise in any Bayes Nash equilibrium where players observed additional information. We show that more information always shrinks the set of Bayes correlated equilibria.
We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with quadratic payoffs and normally distributed uncertainty in terms of restrictions on the first and second moments of the equilibrium action-state distribution. We derive exact bounds on how prior knowledge about the private information refines the set of equilibrium predictions.
We consider information sharing among firms under demand uncertainty and find newly optimal information policies via the Bayes correlated equilibria. Finally, we reverse the perspective and investigate the identification problem under concerns for robustness to private information. The presence of private information leads to set rather than point identification of the structural parameters of the game.
We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with quadratic payoffs and normally distributed uncertainty in terms of restrictions on the first and second moments of the equilibrium action-state distribution. We derive exact bounds on how prior knowledge about the private information refines the set of equilibrium predictions.
We consider information sharing among firms under demand uncertainty and find newly optimal information policies via the Bayes correlated equilibria. Finally, we reverse the perspective and investigate the identification problem under concerns for robustness to private information. The presence of private information leads to set rather than point identification of the structural parameters of the game.
We analyze games of incomplete information and offer equilibrium predictions which are valid for all possible private information structures that the agents may have. Our characterization of these robust predictions relies on an epistemic result which establishes a relationship between the set of Bayes Nash equilibria and the set of Bayes correlated equilibria.
We completely characterize the set of Bayes correlated equilibria in a class of games with quadratic payoffs and normally distributed uncertainty in terms of restrictions on the first and second moments of the equilibrium action-state distribution. We derive exact bounds on how prior information of the analyst refines the set of equilibrium distribution. As an application, we obtain new results regarding the optimal information sharing policy of firms under demand uncertainty.
Finally, we reverse the perspective and investigate the identification problem under concerns for robustness to private information. We show how the presence of private information leads to partial rather than complete identification of the structural parameters of the game. As a prominent example we analyze the canonical problem of demand and supply identification.
We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. The set of outcomes that can arise in equilibrium for some information structure is equal to the set of Bayes correlated equilibria. We completely characterize the set of Bayes correlated equilibria in a class of games with quadratic payoffs and normally distributed uncertainty in terms of restrictions on the first and second moments of the equilibrium action-state distribution. We derive exact bounds on how prior knowledge about the private information refines the set of equilibrium predictions.
We consider information sharing among firms under demand uncertainty and find new optimal information policies via the Bayes correlated equilibria. We also reverse the perspective and investigate the identification problem under concerns for robustness to private information. The presence of private information leads to set rather than point identification of the structural parameters of the game.
This essay is the introduction for a collection of papers by the two of us on “Robust Mechanism Design” to be published by World Scientific Publishing. The appendix of this essay lists the chapters of the book.
The objective of this introductory essay is to provide the reader with an overview of the research agenda pursued in the collected papers. The introduction selectively presents the main results of the papers, and attempts to illustrate many of them in terms of a common and canonical example, the single unit auction with interdependent values.
In addition, we include an extended discussion about the role of alternative assumptions about type spaces in our work and the literature, in order to explain the common logic of the informational robustness approach that unifies the work in this volume.
This note constructs an efficient mechanism for finding the best candidate for a committee from a sequence of potential candidates. Committee members have independent private values information about the quality of the candidate. The mechanism selects the best candidate according to the standard utilitarian welfare criterion. Furthermore, the mechanism can be modified to have a balanced budget.
We analyze the canonical nonlinear pricing model with limited information. A seller offers a menu with a finite number of choices to a continuum of buyers with a continuum of possible valuations. By revealing an underlying connection to quantization theory, we derive the optimal finite menu for the socially efficient and the revenue-maximizing mechanism. In both cases, we provide an estimate of the loss resulting from the usage of a finite n-class menu. We show that the losses converge to zero at a rate proportional to 1/n2 asn becomes large.
A universal type space of interdependent expected utility preference types is constructed from higher-order preference hierarchies describing (i) an agent’s (unconditional) preferences over a lottery space; (ii) the agent’s preference over Anscombe-Aumann acts conditional on the unconditional preferences; and so on.
Two types are said to be strategically indistinguishable if they have an equilibrium action in common in any mechanism that they play. We show that two types are strategically indistinguishable if and only if they have the same preference hierarchy. We examine how this result extends to alternative solution concepts and strategic relations between types.