The Generalized Random Priority Mechanism with Budgets

Abstract

This paper studies allocation problems with and without monetary transfers, such as multi-unit auctions, school choice, and course assignment. For this class of problems, we introduce a generalized random priority mechanism with budgets (GRP). This mechanism is always ex post incentive compatible and feasible. Moreover, as the market grows large, this mechanism can approximate any incentive compatible mechanism in the corresponding continuum economy. In particular, GRP can be used to approximate efficient and envy-free allocations, while preserving incentive compatibility and feasibility.