arXiv subjects

Chris Shannon

Publications and source records attributed to Chris Shannon.

3 recordsLinked to original sources

arXiv2021

Uncertainty and Robustness of Surplus Extraction

This paper studies a robust version of the classic surplus extraction problem, in which the designer knows only that the beliefs of each type belong to some set, and designs mechanisms that are suitable for all possible beliefs in that set. We derive necessary and sufficient conditions for full extraction in this setting, and show that these are natural set-valued analogues of the classic convex independence condition identified by Cremer and McLean (1985, 1988). We show that full extraction is neither generically possible nor generically impossible, in contrast to the standard setting in which full extraction is generic. When full extraction fails, we show that natural additional conditions can restrict both the nature of the contracts a designer can offer and the surplus the designer can obtain.

econ.TH↗

arXiv2021

Detectability, Duality, and Surplus Extraction

We study surplus extraction in the general environment of McAfee and Reny (1992), and provide two alternative proofs of their main theorem. The first is an analogue of the classic argument of Cremer and McLean (1985, 1988), using geometric features of the set of agents' beliefs to construct a menu of contracts extracting the desired surplus. This argument, which requires a finite state space, also leads to a counterexample showing that full extraction is not possible without further significant conditions on agents' beliefs or surplus, even if the designer offers an infinite menu of contracts. The second argument uses duality and applies for an infinite state space, thus yielding the general result of McAfee and Reny (1992). Both arguments suggest methods for studying surplus extraction in settings beyond the standard model, in which the designer or agents might have objectives other than risk neutral expected value maximization.

econ.TH↗

arXiv2021

Uncertainty in Mechanism Design

This paper studies the design of mechanisms that are robust to misspecification. We introduce a novel notion of robustness that connects a variety of disparate approaches and study its implications in a wide class of mechanism design problems. This notion is quantifiable, allowing us to formalize and answer comparative statics questions relating the nature and degree of misspecification to sharp predictions regarding features of feasible mechanisms. This notion also has a behavioral foundation which reflects the perception of ambiguity, thus allowing the degree of misspecification to emerge endogenously. In a number of standard settings, robustness to arbitrarily small amounts of misspecification generates a discontinuity in the set of feasible mechanisms and uniquely selects simple, ex post incentive compatible mechanisms such as second-price auctions. Robustness also sheds light on the value of private information and the prevalence of full or virtual surplus extraction.

econ.TH↗