The Stable Marriage Problem: Structure and Algorithms

  title={The Stable Marriage Problem: Structure and Algorithms},
  author={M. Dyer},
  journal={Journal of the Operational Research Society},
  • M. Dyer
  • Published 1991
  • Computer Science
  • Journal of the Operational Research Society

Topics from this paper

A Generalization of the Lone Wolf Theorem
A non-constructive generalization of the ‘lone wolf’ theorem, which states that in the roommates problem an agent is single in a stable matching if and only if that agent is single in every otherExpand
Many-to-One Stable Matching: Geometry and Fairness
The main result associates a geometric structure with each fractional stable matching, which appears to be interesting in its own right, and can be viewed as a generalization of the lattice structure (for integral stable matchings) to fractionalstable matchings. Expand
Randomized Approximation of the Stable Marriage Problem
A randomized approximation algorithm RANDBRK is given and it is shown that its expected approximation ratio is at most 10/7(< 1.4286) for a restricted but still NP-hard case, where ties occur in only men’s lists, each man writes at most one tie, and the length of ties is two. Expand
Characterization of Super-stable Matchings
A polyhedral characterisation of the set of allsuper-stable matchings is given and it is proved that the super-stable matching polytope is integral, thus solving an open problem stated in the book by Gusfield and Irving. Expand
Information and Software Technologies
The paper propose methodology for benchmark modelling of adequate costs of utilities services, which is based on the data analysis of the factual cases (key performance indicators of utilities as theExpand
A Stable Marriage Requires Communication
The notion of "distance to stability" is introduced and the lower bound for $\Omega(n^2)$ Boolean queries of any type are indeed required for finding a stable - or even an approximately stable - marriage is given. Expand
An Equitable Solution to the Stable Marriage Problem
A novel, deterministic approach that treats both genders equally, while eschewing an exhaustive exploration of the space of all stable matchings is proposed, which not only achieves high-quality solutions, but also terminates efficiently and repeatably on all tested large problem instances. Expand
Algorithmics of Matching Under Preferences
This book builds on the author’s prior research in this area, and also his practical experience of developing algorithms for matching kidney patients to donors in the UK, for assigning medical students to hospitals in Scotland, and for allocating students to elective courses and projects. Expand
An Extended Stable Marriage Problem Algorithm for Clone Detection
A novel approach to detecting clone software by using a bijective matching technique by extending a well-known stable-marriage problem and demonstrating how matches between code fragments of different files can be expressed. Expand
Optimization and measurement in humanitarian operations: addressing practical needs