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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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 …
Surplus Extraction with Behavioral Types
We examine the surplus extraction problem in a mechanism design setting with behavioral types. In our model behavioral types always perfectly reveal their private information. We characterize the sufficient conditions th…
No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
We investigate the strategic surplus obtainable against a Follow-the-Regularized-Leader (FTRL) learner with constant step size $η$ in $n\times m$ two-player zero-sum games played over $T$ rounds against a clairvoyant opt…
Functional Controllability, Functional Stabilisability, and the Generalised Separation Principle
This paper introduces the new concepts of Functional Controllability and Functional Stabilisability, and establishes their duality with Functional Observability and Functional Detectability, respectively. We further pres…
Robust Online Learning with Private Information
This paper investigates the robustness of online learning algorithms when learners possess private information. No-external-regret algorithms, prevalent in machine learning, are vulnerable to strategic manipulation, allo…