Abstract
We consider the Stable Marriage Problem and the Stable Roommates Problem, two well-known types of the general class of Stable Matching Problems. They are combinatorial problems which can be solved by centralized algorithms in polynomial time. This requires to make public lists of preferences which agents would like to keep private. With this aim, we define the distributed version of these problems, and we provide a constraint-based approach that solves them keeping privacy. We give empirical results on the proposed approach. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Brito, I., & Meseguer, P. (2005). Distributed stable matching problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 152–166). https://doi.org/10.1007/11564751_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
