We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in...

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in...

We consider the problem of allocating m objects to n agents. Each agent has unit demand, and has strict preferences over the objects. There are qj units of object j available and the problem is balanced in the sense that ∑jqj=n. An allocation specifies the amount of each object j that is...