Abstract
The paper defines a measure on the set of stable matchings in the marriage problem. This measure is based on the minimization of the envy difference between the sets of men and women, while preserving stability and selects stable matchings with the least conflict of interest between both groups of agents. The solution concept proposed is called Sex-equal Matching (SEM) and the paper also provides an algorithm to compute the set of SEM.
Similar content being viewed by others
REFERENCES
Gale, D. and Shapley, Ll. (1962), College admissions and the stability of marriage, American Mathematical Monthly 69: 9-15.
Grätzer, G. (1978), General lattice theory. Academic Press, New York.
Gusfield, D. and Irving, R.W. (1989), The stable marriage problem, structure and algorithms. The M.I.T. Press, Cambridge, Massachusetts.
Knuth, D.E. (1976), Marriage stables. Les Presses de l'Université de Montréal, Montreal.
Ma, J. (1996), On randomized matching mechanisms, Economic Theory 8(2): 377-381.
Masarani, F. and Gokturk, S.S. (1989), On the existence of fair matching algorithms, Theory and Decision 26: 305-322.
Masarani, F. and Gokturk, S.S. (1991), A problem in discrete distributive justice, Economics Letters 36: 253-256.
Roth, A.E. and Sotomayor, M. (1990), Two-sided matching markets: a study in game theoretic modeling and analysis, [Econometric Society Monograph]. Cambridge University Press, Cambridge,Massachusetts.
Roth, A., and Vande Vate, J.H. (1990), Random paths to stability in two-sided matching, Econometrica 58: 1475-1480.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Romero-Medina, A. `Sex-Equal' Stable Matchings. Theory and Decision 50, 197–212 (2001). https://doi.org/10.1023/A:1010311325241
Issue Date:
DOI: https://doi.org/10.1023/A:1010311325241