论文标题
分配最大化
Assignment Maximization
论文作者
论文摘要
我们评估了最大化与可接受结果相匹配的个体数量的目标。我们表明，这意味着激励，公平和实施不可能。尽管如此，我们提出了两类的机制，可以最大程度地提高任务。第一个以平衡状态是帕累托的效率，而在分配的数量方面是不主导的。第二个对未分配的学生来说是公平的，并且分配了比平衡的稳定机制的学生更多的学生。
We evaluate the goal of maximizing the number of individuals matched to acceptable outcomes. 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 terms of number of assignments -- in equilibrium. The second are fair for unassigned students and assign weakly more students than stable mechanisms in equilibrium.
