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.
- Constraint Satisfaction Problem
- Stable Match
- Preference List
- Current Partner
- Stable Marriage
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.