Abstract
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.
Supported by the Spanish project TIN2005-09312-C03-01.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brito, I., Meseguer, P.: Distributed Forward Checking. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 801–806. Springer, Heidelberg (2003)
Brito, I., Meseguer, P.: Distributed Stable Marriage with Ties and Incomplete Lists. In: Proc. ECAI 2006 Workshop on Distributed Constraint Satisfaction (2006)
Brito, I., Meseguer, P.: Distributed Stable Matching Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 152–166. Springer, Heidelberg (2005)
Gent, I., et al.: A constraint programming approach to the stable marriage problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 225–239. Springer, Heidelberg (2001)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge (1989)
Irving, R.W.: Stable Marriage and Indifference. Discr. Appl. Maths. 48, 261–272 (1994)
Manlove, D.F.: Stable marriage with Ties and Unacceptable Partners. TR-1999-29, Dep. Computing Science, Univ. Glasgow (1999)
Irving, R.W., Manlove, D.F.: The roommates problem with ties. J. Algorithms 43(1), 85–105 (2002)
Silaghi, M.C., Zanker, M., Bartak, R.: Desk-mates (Stable Matching) with Privacy of Preferences, and a new Distributed CSP Framework. In: Proc. of CP 2004 Workshop on Immediate Applications of Constraint Programming (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brito, I., Meseguer, P. (2006). Distributed Stable Matching Problems with Ties and Incomplete Lists. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_49
Download citation
DOI: https://doi.org/10.1007/11889205_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)