arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.06836cs.AI
收藏

具有部分偏好的多类型资源分配

Multi-type Resource Allocation with Partial Preferences

Peking University(北京大学);Washington University in St. Louis(圣路易斯华盛顿大学);Rensselaer Polytechnic Institute(伦斯勒理工学院);Guangzhou University(广州大学)

Haibin Wang, Sujoy Sikdar, Xiaoxi Guo, Lirong Xia, Yongzhi Cao, Hanpin Wang

摘要:

我们提出了多类型的概率序列(MPS)和多类型的随机优先级(MRP)的扩展众所周知的PS和RP机制的多类型的部分偏好的资源分配问题(MTRA)。在我们的设置中,有多种类型的可分割的项目,和一组代理人谁拥有部分订单偏好的捆绑组成的每种类型的一个项目。我们表明,对于不受限制的领域的偏序偏好,没有机制同时满足sd-效率和sd-嫉妒-自由。尽管这个不可能的结果,我们的主要信息是积极的:当代理的偏好表示的非循环CP网,MPS满足sd-效率,sd-嫉妒,自由,顺序公平,和上不变性,而MRP满足前后效率,sd-策略,证明,和上不变性,恢复PS和RP的属性。

英文摘要:

We propose multi-type probabilistic serial (MPS) and multi-type random priority (MRP) as extensions of the well known PS and RP mechanisms to the multi-type resource allocation problem (MTRA) with partial preferences. In our setting, there are multiple types of divisible items, and a group of agents who have partial order preferences over bundles consisting of one item of each type. We show that for the unrestricted domain of partial order preferences, no mechanism satisfies both sd-efficiency and sd-envy-freeness. Notwithstanding this impossibility result, our main message is positive: When agents' preferences are represented by acyclic CP-nets, MPS satisfies sd-efficiency, sd-envy-freeness, ordinal fairness, and upper invariance, while MRP satisfies ex-post-efficiency, sd-strategy-proofness, and upper invariance, recovering the properties of PS and RP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑