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

DOI10.1016/J.ARTINT.2019.08.002MaRDI QIDQ2289006zbMATH OpenOpenAlexFDO

Authors Haris Aziz, Péter Biró, Ronald de Haan, Baharak Rastegari

Publication date 20 January 2020

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/433512/1/effcomp_journal.pdf

zbMATH Keywords

Pareto optimalityresource allocationfair divisionuncertain preferences

Mathematics Subject Classification ID

Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Efficient reallocation under additive and responsive preferences
• scientific article; zbMATH DE number 165312
• The complexity of computing the random priority allocation matrix
• Algorithms and Computation
• Algorithms and Computation

Cites work

• A new solution to the random assignment problem.
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Algorithms and Computation
• Assignment Problem Based on Ordinal Preferences
• Distributed fair allocation of indivisible goods
• House allocation with existing tenants
• Matching theory
• On the evaluation of election outcomes under uncertainty
• Parametrized complexity theory.
• Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity
• Queue allocation of indivisible goods
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Stable Matching with Uncertain Linear Preferences
• Strategy-proof allocation of indivisible goods
• The Complexity of Enumeration and Reliability Problems
• The Parameterized Complexity of Counting Problems
• The complexity of computing the random priority allocation matrix
• Two-sided matching with indifferences

Cited in

(12)

• Multi-agent task allocation under unrestricted environments
• Efficient reallocation under additive and responsive preferences
• Applications of Optimization Theory to Social Benefit Maximizations in Macroeconomics with Uncertainty
• Stable matching with uncertain pairwise preferences
• Stable matching with uncertain linear preferences
• Pareto optimal allocations and dynamic programming
• Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
• Preference aggregation under uncertainty: Savage vs. Pareto
• Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
• Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity
• Equilibrium in a two-agent assignment problem
• scientific article; zbMATH DE number 165312 (Why is no real title available?)

This page was built for publication: Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289006)