z-logo
open-access-imgOpen Access
Neutral Optima in Informed Principal Problems with Common Values
Author(s) -
Dieter Balkenborg,
Miltiades Makris
Publication year - 2009
Publication title -
ssrn electronic journal
Language(s) - English
Resource type - Journals
ISSN - 1556-5068
DOI - 10.2139/ssrn.1420202
Subject(s) - principal (computer security) , mathematics , statistics , computer science , operating system
In a class of informed principal problems with common values often used in applications we de…fine a particular mechanism which we call the assured allocation. It is always undominated, i.e. efficient among the different types of the principal. We show it is a perfect Bayesian equilibrium allocation of the three-stage game studied in Maskin and Tirole (1992) that coincides with the Rothschild-Stiglitz- Wilson allocation when the latter is undominated. Under familiar conditions on hazard rates we show that the assured allocation is a neutral optimum in the sense of Myerson (1983).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom