Abstract
The stable marriage problem has many practical applications in two-sided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Most algorithms to find stable marriages assume that the participants explicitly expresses a preference ordering. This can be problematic when the number of options is large or has a combinatorial structure. We consider therefore using CP-nets, a compact preference formalism in stable marriage problems. We study the impact of this formalism on the computational complexity of stable marriage procedures, as well as on the properties of the solutions computed by these procedures. We show that it is possible to model preferences compactly without significantly increasing the complexity of stable marriage procedures and whilst maintaining the desirable properties of the matching returned.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. (JAIR) 21, 135–191 (2004)
Brafman, R.I., Chernyavsky, Y.: Planning with goal preferences and constraints. In: ICAPS, pp. 182–191 (2005)
Brafman, R.I., Domshlak, C., Kogan, T.: Compact value-function representations for qualitative preferences. In: UAI, pp. 51–59. AUAI Press (2004)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69 (1962)
Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM Journal of Computing 16(1) (1987)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pilotto, E., Rossi, F., Venable, K.B., Walsh, T. (2009). Compact Preference Representation in Stable Marriage Problems. In: Rossi, F., Tsoukias, A. (eds) Algorithmic Decision Theory. ADT 2009. Lecture Notes in Computer Science(), vol 5783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04428-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-04428-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04427-4
Online ISBN: 978-3-642-04428-1
eBook Packages: Computer ScienceComputer Science (R0)