Compact Preference Representation in Stable Marriage Problems

Authors:
Enrico Pilotto;Francesca Rossi;Kristen Brent Venable;Toby Walsh
Affiliations:
Department of Pure and Applied Mathematics, University of Padova, Italy;Department of Pure and Applied Mathematics, University of Padova, Italy;Department of Pure and Applied Mathematics, University of Padova, Italy;NICTA and UNSW, Sydney, Australia
Venue:
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Year:
2009

Citing 4
Cited 0

Three fast algorithms for four problems in stable marriage

SIAM Journal on Computing
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Compact value-function representations for qualitative preferences

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

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.