Nested potentials and robust equilibria

This paper introduces the notion of nested best response potentials for complete information games. It is shown that a unique maximizer of such a potential is a Nash equilibrium that is robust to incomplete information in the sense of Kajii and Morris (1997, mimeo).incomplete information, potential games, robustness, refinements

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 and shows that the sufficient conditions generalize the existing sufficient conditions for the robustness of equilibria.Incomplete information, Potential, Refinements, Robustness

Nested potentials and robust equilibria

This paper introduces the notion of nested best-response potentials for complete in- formation games. It is shown that a unique maximizer of such a potential is a Nash equilibrium that is robust to incomplete information in the sense of Kajii and Morris (1997, mimeo).incomplete information, potential games, robustness, refinements

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 Predictions in Games with Incomplete Information

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.Incomplete information, Correlated equilibrium, Robustness to private information, Moments restrictions, Identification, Information bounds

Implementation in adaptive better-response dynamics: Towards a general theory of bounded rationality in mechanisms.

We study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses or bestresponses. First, we show that a necessary condition for recurrent implementation in better-response dynamics (BRD) is a small variation of Maskin monotonicity, which we call quasimonotonicity. We also provide a mechanism for implementation in BRD if the rule is quasimonotonic and excludes worst alternatives – no worst alternative (NWA). Quasimonotonicity and NWA are both necessary and sufficient for absorbing implementation in BRD. Moreover, they characterize implementation in strict Nash equilibria. Under incomplete information, incentive compatibility is necessary for any kind of stable implementation in our sense, while Bayesian quasimonotonicity is necessary for recurrent implementation in interim BRD. Both conditions are also essentially sufficient for recurrent implementation, together with a Bayesian NWA. A characterization of implementation in strict Bayesian equilibria is also provided. Partial implementation results are also obtained.Robust implementation; Bounded rationality; Evolutionary dynamics; Mechanisms;