The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Stable marriage and indifference
CO89 Selected papers of the conference on Combinatorial Optimization
The stable roommates problem with ties
Journal of Algorithms
A Constraint Programming Approach to the Stable Marriage Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Distributed stable matching problems with ties and incomplete lists
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A Constraint Programming Approach to the Hospitals / Residents Problem
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Distributed forward checking may lie for privacy
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Distributed stable matching problems with ties and incomplete lists
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Distributed weighted stable marriage problem
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Virtual Machine Coscheduling: A Game Theoretic Approach
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
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.