# Multi-type Resource Allocation with Partial Preferences

arXiv: https://arxiv.org/abs/1906.06836 · HTML: https://mlsanity.com/paper/1906.06836/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Jun 2019.

## Built on by (most cited first, 2 of 2)

- [Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms](https://mlsanity.com/paper/2109.08856/) (2021)
- [Sequential Mechanisms for Multi-type Resource Allocation](https://mlsanity.com/paper/2101.12522/) (2021)

## Abstract (arXiv)

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.