`Sex-Equal' Stable Matchings

Theory and Decision 50 (3):197-212 (2001)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
The matching of parts of things.Charles J. Jardine & Nicholas Jardine - 1971 - Studia Logica 27 (1):123 - 132.
Same-Sex Marriage and Equality.Reginald Williams - 2011 - Ethical Theory and Moral Practice 14 (5):589-595.
Equal Opportunity, Freedom and Sex-Stereotyping.Susan Leigh Anderson - 1991 - Journal of Philosophical Research 16:1-10.
Subgroups of stable groups.Frank Wagner - 1990 - Journal of Symbolic Logic 55 (1):151-156.
Simple stable homogeneous groups.Alexander Berenstein - 2003 - Journal of Symbolic Logic 68 (4):1145-1162.
On atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.

Analytics

Added to PP
2010-09-02

Downloads
140 (#132,623)

6 months
6 (#520,848)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On the existence of fair matching algorithms.F. Masarani & S. S. Gokturk - 1989 - Theory and Decision 26 (3):305-322.

Add more references