Differential information in large games with strategic complementarities

We study equilibrium in large games of strategic complementarities (GSC) with differential information. We define an appropriate notion of distributional Bayesian Nash equilibrium and prove its existence. Furthermore, we characterize order-theoretic properties of the equilibrium set, provide monotone comparative statics for ordered perturbations of the space of games, and provide explicit algorithms for computing extremal equilibria. We complement the paper with new results on the existence of Bayesian Nash equilibrium in the sense of Balder and Rustichini (J Econ Theory 62(2):385–393, 1994) or Kim and Yannelis (J Econ Theory 77(2):330–353, 1997) for large GSC and provide an analogous characterization of the equilibrium set as in the case of distributional Bayesian Nash equilibrium. Finally, we apply our results to riot games, beauty contests, and common value auctions. In all cases, standard existence and comparative statics tools in the theory of supermodular games for finite numbers of agents do not apply in general, and new constructions are required

Robust Mechanism Design: An Introduction

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.Mechanism design, Robust mechanism design, Common knowledge, Universal type space, Interim equilibrium, Ex post equilibrium, Dominant strategies, Rationalizability, Partial implementation, Full implementation, Robust implementation

Robust Mechanism Design

The mechanism design literature assumes too much common knowledge of the environment among the players and planner. We relax this assumption by studying implementation on richer type spaces. We ask when ex post implementation is equivalent to interim (or Bayesian) implementation for all possible type spaces. The equivalence holds in the case of separable environments; examples of separable environments arise (1) when the planner is implementing a social choice function (not correspondence); and (2) in a quasilinear environment with no restrictions on transfers. The equivalence fails in general, including in some quasilinear environments with budget balance. In private value environments, ex post implementation is equivalent to dominant strategies implementation. The private value versions of our results offer new insights into the relation between dominant strategy implementation and Bayesian implementation.Mechanism design, Common knowledge, Universal type space, Interim equilibrium, Ex-post equilibrium, Dominant strategies

A simple status quo that ensures participation (with application to efficient bargaining)

We consider Bayesian incentive-compatible mechanisms with independent types and either private values or interdependent values that satisfy a form of "congruence." We show that in these settings, interim participation constraints are satisfied when the status quo is the randomized allocation that has the same distribution as the equilibrium allocation in the mechanism. Moreover, when utilities are convex in the allocation, we can instead satisfy participation constraints with the deterministic status quo equal to the expected equilibrium allocation in the mechanism. For quasilinear settings, these observations imply the possibility of efficient bargaining when the status quo specifies the expected efficient decision provided that the total surplus is convex in the decision.Efficient property rights, asymmetric information bargaining, transaction costs

Robust Implementation in General Mechanisms

A social choice function is robustly implemented if every equilibrium on every type space achieves outcomes consistent with it. We identify a robust monotonicity condition that is necessary and (with mild extra assumptions) sufficient for robust implementation. Robust monotonicity is strictly stronger than both Maskin monotonicity (necessary and almost sufficient for complete information implementation) and ex post monotonicity (necessary and almost sufficient for ex post implementation). It is equivalent to Bayesian monotonicity on all type spaces.Mechanism design, Implementation, Robustness, Common knowledge, Interim equilibrium, Dominant strategies