Compact Preference Representation in Stable Marriage Problems
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.
KeywordsPartial Order Dependency Graph Stable Match Current Partner Stable Marriage
Unable to display preview. Download preview PDF.
- 2.Brafman, R.I., Chernyavsky, Y.: Planning with goal preferences and constraints. In: ICAPS, pp. 182–191 (2005)Google Scholar
- 3.Brafman, R.I., Domshlak, C., Kogan, T.: Compact value-function representations for qualitative preferences. In: UAI, pp. 51–59. AUAI Press (2004)Google Scholar
- 4.Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69 (1962)Google Scholar
- 5.Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM Journal of Computing 16(1) (1987)Google Scholar