Pareto Optimal Allocation Under Compact Uncertain Preferences
Abstract
The assignment problem is one of the most well-studied settings in multi-agent resource allocation. Aziz, de Haan, and Rastegari (2017) considered this problem with the additional feature that agents’ preferences involve uncertainty. In particular, they considered two uncertainty models neither of which is necessarily compact. In this paper, we focus on three uncertain preferences models whose size is polynomial in the number of agents and items. We consider several interesting computational questions with regard to Pareto optimal assignments. We also present some general characterization and algorithmic results that apply to large classes of uncertainty models.
Cite
Text
Aziz et al. "Pareto Optimal Allocation Under Compact Uncertain Preferences." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33011740Markdown
[Aziz et al. "Pareto Optimal Allocation Under Compact Uncertain Preferences." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/aziz2019aaai-pareto/) doi:10.1609/AAAI.V33I01.33011740BibTeX
@inproceedings{aziz2019aaai-pareto,
title = {{Pareto Optimal Allocation Under Compact Uncertain Preferences}},
author = {Aziz, Haris and Biró, Péter and de Haan, Ronald and Rastegari, Baharak},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
pages = {1740-1747},
doi = {10.1609/AAAI.V33I01.33011740},
url = {https://mlanthology.org/aaai/2019/aziz2019aaai-pareto/}
}