In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result
Bistable Versions of the Marriages and Roommates Problems
โ Scribed by B.P. Weems
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 291 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
โฆ Synopsis
A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice of the distributive lattice of stable matchings. In addition, the Gale Shapley algorithm is modified to find the man-optimal bistable matching and to determine the irreducible bistable matchings.
๐ SIMILAR VOLUMES
Forty-five individuals (22 couples and 1 widowed person) living in arranged marriages in India completed questionnaires measuring marital satisfaction and wellness. The data were compared with existing data on individuals in the United States living in marriages of choice. Differences were found in
We study the stable marriage problem from different points of view. We proposed a microscopic dynamic that led the system to a stationary state that we are able to characterize analytically. Then, we derive a thermodynamical description of the Nash equilibrium states of the system that agree very we