英文标题：
《The Probabilistic Serial and Random Priority Mechanisms with Minimum
Quotas》
---
作者：
Marek Bojko
---
最新提交年份：
2020
---
英文摘要：
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.
---
中文摘要：
考虑将不可分割的对象分配给对对象具有严格顺序偏好的代理的问题，其中每个代理都有兴趣消费最多一个对象，并且对象具有整数最小和最大配额。我们定义一个任务是可行的，如果它满足所有的配额，并假设这样的任务总是存在的。概率序列（PS）和随机优先级（RP）机制基于相同的直观想法进行了推广：允许代理使用其最喜欢的可用对象，直到尚未分配的代理的总质量完全等于剩余的未完成较低配额；在这种情况下，我们将代理的菜单限制为尚未满足其最低配额的对象。我们证明了这些机制满足与经典机制相同的标准：PS是顺序有效、无嫉妒且弱策略证明的；RP是一种策略证明，没有嫉妒感，但效率不高。
---
分类信息：

一级分类：Economics 经济学
二级分类：Theoretical Economics 理论经济学
分类描述：Includes theoretical contributions to Contract Theory, Decision Theory, Game Theory, General Equilibrium, Growth, Learning and Evolution, Macroeconomics, Market and Mechanism Design, and Social Choice.
包括对契约理论、决策理论、博弈论、一般均衡、增长、学习与进化、宏观经济学、市场与机制设计、社会选择的理论贡献。
--
一级分类：Computer Science 计算机科学
二级分类：Computer Science and Game Theory 计算机科学与博弈论
分类描述：Covers all theoretical and applied aspects at the intersection of computer science and game theory, including work in mechanism design, learning in games (which may overlap with Learning), foundations of agent modeling in games (which may overlap with Multiagent systems), coordination, specification and formal methods for non-cooperative computational environments. The area also deals with applications of game theory to areas such as electronic commerce.
涵盖计算机科学和博弈论交叉的所有理论和应用方面，包括机制设计的工作，游戏中的学习（可能与学习重叠），游戏中的agent建模的基础（可能与多agent系统重叠），非合作计算环境的协调、规范和形式化方法。该领域还涉及博弈论在电子商务等领域的应用。
--

---
PDF下载：
-->