|Títol||Distributed Stable Matching Problems with Ties and Incomplete Lists|
|Publication Type||Conference Paper|
|Year of Publication||2006|
|Authors||Brito I, Meseguer P|
|Conference Name||Lecture notes in computer science|
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this requires to make public preference lists, something that members would prefer to avoid for privacy reasons. This motivates a distributed formulation to keep privacy. We propose a distributed constraint approach that solves all the considered problems, keeping privacy.
- Quant a IIIA