Pareto Optimal Allocation under Uncertain Preferences

@inproceedings{Aziz2017ParetoOA,
  title={Pareto Optimal Allocation under Uncertain Preferences},
  author={Haris Aziz},
  booktitle={IJCAI},
  year={2017}
}
The assignment problem is one of the most wellstudied 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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 38 references

In Proceedings of the 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)

  • Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot. Optimal reallocation under additive, ordinal preferences
  • pages 402–410,
  • 2016
4 Excerpts

In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI)

  • Haris Aziz, Jérôme Lang, Jérôme Monnot. Computing Pareto Optimal Committees
  • pages 60–66,
  • 2016
4 Excerpts

In Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT)

  • Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari. Stable matching with uncertain linear preferences
  • pages 195–206,
  • 2016
4 Excerpts

In Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)

  • Haris Aziz, Simon Mackenzie, Lirong Xia, Chun Ye. Ex post efficiency of random assignments
  • pages 1639–1640,
  • 2015
4 Excerpts

Mathematics of Operations Research

  • Daniela Saban, Jay Sethuraman. The complexity of computing the random matrix
  • 40(4):1005 –1014,
  • 2015
1 Excerpt

Similar Papers

Loading similar papers…