The University of Southampton
University of Southampton Institutional Repository

Pareto optimal allocation under uncertain preferences

Pareto optimal allocation under uncertain preferences
Pareto optimal allocation under uncertain preferences
The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider this 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 two natural uncertainty models:(1) the lottery model in which each agent has an independent probability distribution over linear orders and (2) the joint probability model that involves a joint probability distribution over preference profiles. For both of these models, we present a number of algorithmic and complexity of the two models.
1472-1474
International Foundation for Autonomous Agents and Multiagent Systems
Aziz, Haris
99c295f2-f10c-4e8e-b48c-3f4048a075f3
de Haan, Ronald
2d29a3e0-f335-4cdf-a62b-c1c293283839
Rastegari, Baharak
6ba9e93c-53ba-4090-8f77-c1cb1568d7d1
Aziz, Haris
99c295f2-f10c-4e8e-b48c-3f4048a075f3
de Haan, Ronald
2d29a3e0-f335-4cdf-a62b-c1c293283839
Rastegari, Baharak
6ba9e93c-53ba-4090-8f77-c1cb1568d7d1

Aziz, Haris, de Haan, Ronald and Rastegari, Baharak (2017) Pareto optimal allocation under uncertain preferences. In, Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, pp. 1472-1474.

Record type: Book Section

Abstract

The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider this 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 two natural uncertainty models:(1) the lottery model in which each agent has an independent probability distribution over linear orders and (2) the joint probability model that involves a joint probability distribution over preference profiles. For both of these models, we present a number of algorithmic and complexity of the two models.

Text
1609.02795 - Author's Original
Download (206kB)

More information

Published date: 8 May 2017

Identifiers

Local EPrints ID: 425879
URI: https://eprints.soton.ac.uk/id/eprint/425879
PURE UUID: 68b40378-082d-41dd-9260-0f3675689944
ORCID for Baharak Rastegari: ORCID iD orcid.org/0000-0002-0985-573X

Catalogue record

Date deposited: 06 Nov 2018 17:30
Last modified: 14 Mar 2019 01:20

Export record

Contributors

Author: Haris Aziz
Author: Ronald de Haan
Author: Baharak Rastegari ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×