In this paper we show how skylines can be used to improve the stable matching algorithm with asymmetric preference sets for men and women. The skyline set of men (or women) in a dataset comprises of those who are not worse off in all the qualities in comparison to another man (or woman). We prove that if a man in the skyline set is matched with a woman in the skyline set, the resulting pair is stable. We design our algorithm, SMS, based on the above observation by running the matching algorithm in phases considering only the skyline sets. In addition to being efficient, SMS provides two important additional properties. The first is progressiveness where stable pairs are output without waiting for the entire algorithm to finish. The second is balance in quality between men versus women since the proposers are switched automatically between the sets. Empirical results show that SMS runs orders of magnitude faster than the original Gale-Shapley algorithm and produces better quality matchings.
[1]
Bernhard Seeger,et al.
An optimal and progressive algorithm for skyline queries
,
2003,
SIGMOD '03.
[2]
L. B. Wilson,et al.
Stable marriage assignment for unequal sets
,
1970
.
[3]
Kyriakos Mouratidis,et al.
A Fair Assignment Algorithm for Multiple Preference Queries
,
2009,
Proc. VLDB Endow..
[4]
Antonin Guttman,et al.
R-trees: a dynamic index structure for spatial searching
,
1984,
SIGMOD '84.
[5]
L. S. Shapley,et al.
College Admissions and the Stability of Marriage
,
2013,
Am. Math. Mon..
[6]
Jan Chomicki,et al.
Skyline with presorting
,
2003,
Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).
[7]
Christopher D. Manning,et al.
Introduction to Information Retrieval
,
2010,
J. Assoc. Inf. Sci. Technol..
[8]
Donald Kossmann,et al.
The Skyline operator
,
2001,
Proceedings 17th International Conference on Data Engineering.