We introduce a subsidized Vickrey auction for cost sharing problems. Although the average, marginal, and serial cost sharing mechanisms are budget-balanced, they are not allocatively efficient and they do not induce players to truthfully reveal their values as a dominant strategy. The...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

We introduce a subsidized Vickrey auction for cost sharing problems. Although the average, marginal, and serial cost sharing mechanisms are budget-balanced, they are not allocatively efficient and they do not induce players to truthfully reveal their values as a dominant strategy. The...

We study mechanism design in a setting where agents know their types but are uncertain about the utility from any alternative. The final realized utility of each agent is observed by the principal and can be contracted upon. In such environments, the principal is not restricted to using only...