Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity

摘要

The assignment problem is one of the most well-studied settings in multi-agent resource allocation. Agents express preferences over indivisible items and then the items are allocated based on these preferences. Pareto optimality is regarded as a desirable property for the chosen allocation, requiring that no other allocation exists in which no agent is worse off and at least one agent is better of. We consider the assignment problem with the additional feature that agents' preferences involve uncertainty. The setting with uncertainty leads to a number of interesting questions including the following ones. How to compute an assignment with the highest probability of being Pareto optimal? What is the complexity of computing the probability that a given assignment is Pareto optimal? Does there exist an assignment that is Pareto optimal with probability one? We consider these problems under five natural uncertainty models. For all of the models, we present a number of algorithmic and complexity results highlighting the differences and similarities in the complexity of the models. We also present some general characterization and algorithmic results that apply to large classes of uncertainty models.