论文标题
具有最低配额的概率串行和随机优先级机制
The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas
论文作者
论文摘要
考虑将不可分割的对象分配给对象严格偏好的代理的问题，在这些代理中，每个代理都对最多消耗一个对象感兴趣，并且对象具有整数最小和最大配额。我们将任务定义为可行的，如果它满足所有配额并认为总是存在这样的作业。基于相同的直觉思想，概率序列（PS）和随机优先级（RP）机制是概括性的：允许代理消耗其最喜欢的可用对象，直到尚未分配的代理总质量完全等于剩余的未填充较低较低的较低配额；在这种情况下，我们将代理商的菜单限制为尚未填充其最低配额的对象。我们显示的机制满足了与他们的经典同行相同的标准：PS是有效的，无嫉妒的，否定策略的； RP是防止策略的，无弱的，但不是很高效的。
Consider the problem of assigning indivisible objects to agents with strict ordinal preferences over objects, where each agent is interested in consuming at most one object, and objects have integer minimum and maximum quotas. We define an assignment to be feasible if it satisfies all quotas and assume such an assignment always exists. The Probabilistic Serial (PS) and Random Priority (RP) mechanisms are generalised based on the same intuitive idea: Allow agents to consume their most preferred available object until the total mass of agents yet to be allocated is exactly equal to the remaining amount of unfilled lower quotas; in this case, we restrict agents' menus to objects which are yet to fill their minimum quotas. We show the mechanisms satisfy the same criteria as their classical counterparts: PS is ordinally efficient, envy-free and weakly strategy-proof; RP is strategy-proof, weakly envy-free but not ordinally efficient.
