Stable Matching with Uncertain Linear Preferences

DOI10.1007/978-3-662-53354-3_16zbMath1403.91254OpenAlexW2482442656MaRDI QIDQ2819459

Haris Aziz, Nicholas Mattei, Serge Gaspers, Ronald de Haan, Péter Biró, Baharak Rastegari

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://dare.uva.nl/personal/pure/en/publications/stable-matching-with-uncertain-linear-preferences(7f97f707-439a-491c-bafb-86320cef80a6).html

zbMATH Keywords

computational complexitytwo-sided stable matchinguncertainty of agents' preferences

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)

Related Items (9)

Complexity study for the robust stable marriage problem ⋮ Robust and approximately stable marriages under partial information ⋮ Jointly stable matchings ⋮ Multi-agent task allocation under unrestricted environments ⋮ Three-sided stable matching problem with two of them as cooperative partners ⋮ Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity ⋮ Stable Matching with Uncertain Linear Preferences ⋮ Pairwise Preferences in the Stable Marriage Problem ⋮ Stable matching with uncertain linear preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Matching markets under (in)complete information
• Stable marriage and indifference
• On the evaluation of election outcomes under uncertainty
• The Potts model and the Tutte polynomial
• Stable Matching with Uncertain Linear Preferences
• Improved approximation results for the stable marriage problem
• Algorithmics of Matching Under Preferences

This page was built for publication: Stable Matching with Uncertain Linear Preferences