2 papers
cs.GT2016
Stable Matching with Uncertain Linear Preferences
Haris Aziz, Péter Biró, Serge Gaspers +3
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three mod…
cs.GT2016
Preference Elicitation in Matching Markets via Interviews: A Study of Offline Benchmarks
Baharak Rastegari, Paul Goldberg, David Manlove
The stable marriage problem and its extensions have been extensively studied, with much of the work in the literature assuming that agents fully know their own preferences over alt…