In a class of informed principal problems with common values, we define iteratively a particular allocation which we call the assured allocation. It is comparatively easy to calculate and straightforward to interpret. It always exists, is unique and continuous in the priors. It is undominated,...

This paper considers general games in which multiple informed principals simultaneously compete to influence the decisions of a common agent. It shows that we can characterize all outcomes of any game in which principals delegate the final decisions to the agent using arbitrary mechanisms, by...

We investigate the issue of implementation via individually rational ex-post budget-balanced Bayesian mechanisms. We demonstrate that all social choice rules that generate a nonnegative ex-ante surplus, including ex-post efficient ones, can generically be implemented via such mechanisms for any...

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...