Multi-type Resource Allocation with Partial Preferences
Multi-type Resource Allocation with Partial Preferences
复制标题
DOI：
10.1609/aaai.v34i02.5603
复制
发表时间：
2019-06
期刊：
影响因子：
--
通讯作者：
Haibin Wang;Sujoy Sikdar;Xiaoxi Guo;Lirong Xia;Yongzhi Cao;Hanpin Wang
中科院分区：
文献类型：
--
作者：
Haibin Wang;Sujoy Sikdar;Xiaoxi Guo;Lirong Xia;Yongzhi Cao;Hanpin Wang
我们将多型概率序列（MPS）和多类随机优先级（MRP）作为众所周知的PS和RP机制扩展到具有部分偏好的多类型资源分配问题（MTRA）。在我们的环境中，有多种可分割的项目，以及一组代理，它们具有由每种类型的一项组成的部分订单首选项。我们表明，对于部分秩序偏好的不受限制领域，没有机制满足SD效率和SD征收纯度。尽管有这种不可能的结果，但我们的主要信息是积极的：当代理的偏好由无环的CP-NET代表时，MPS满足SD效率，SD-ANVY范围，柔性，有序公平和上部不变性，而MRP满足前POST效率，SD-SD-Stratexyments和propper Invariance＆Eppect and Invariancience，恢复了PSS和RP的属性。此外，我们提出了一种混合机制，多类型的一般独裁统治（MGD），将MPS和MRP的思想结合在一起，该想法满足了SD效率，在部分秩序偏好的不受限制领域下，平等和可分解性的同等处理。
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 problems (MTRAs) 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-strategyproofness, and upper invariance, recovering the properties of PS and RP. Besides, we propose a hybrid mechanism, multi-type general dictatorship (MGD), combining the ideas of MPS and MRP, which satisfies sd-efficiency, equal treatment of equals and decomposability under the unrestricted domain of partial order preferences.