`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

Other Versions

No versions found

Links

PhilArchive

External links

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

Through your library

Analytics

Added to PP
2010-09-02

Downloads
192 (#210,087)

6 months
6 (#1,539,328)

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