Pareto Optimal Allocation under Compact Uncertain Preferences

  • Haris Aziz University of New South Wales
  • Peter Biro Hungarian Academy of Sciences
  • Ronald de Haan University of Amsterdam
  • Baharak Rastegari Bristol University

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.

Published
2019-07-17
Section
AAAI Technical Track: Game Theory and Economic Paradigms