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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Brito, I., & Meseguer, P. (2006). Distributed stable matching problems with ties and incomplete lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4204 LNCS, pp. 675–679). Springer Verlag. https://doi.org/10.1007/11889205_49
Mendeley helps you to discover research relevant for your work.