The Generalized Random Priority Mechanism with Budgets

Abstract

This paper studies allocation problems with and without monetary transfers, such as combinatorial auctions, school choice, and course allocation. Interdependent values and multidimensional signals are allowed. Despite known negative results, a mechanism exists that is feasible, ex post individually rational, ex post incentive compatible, and asymptotically both efficient and envy-free. This mechanism is a special case of the generalized random priority mechanism (GRP), which always satisfies the first three properties. The asymptotic properties follow as a corollary of the main theorem: GRP approximates virtually any infinite-market mechanism in large finite markets.

Keywords: ex post incentive compatibility, random allocation, random priority, large market, rational expectations equilibrium, information aggregation