Paths to marriage stability
type: Item
instance of: scholarly article
title: Paths to marriage stability
zbMATH Open document ID: 0836.05060
DOI: 10.1016/0166-218X(94)00026-A
author: Hernán G. Abeledo
author: Uriel G. Rothblum
published in: Discrete Applied Mathematics
publication date: 1996-03-26T00:00:00Z
review text: In the stable marriage problem, one can start with an arbitrary matching and repeatedly adjust it to satisfy a blocking pair (a woman and a man who each prefer the other to their current partner). This need not converge, but it has been shown that judicious choice of the blocking pair to be satisfied leads to convergence. In this paper, the authors examine in some detail the conditions under which the algorithm does converge.
reviewed by: Charles J. Colbourn
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 91A40
zbMATH DE Number: 822828
zbMATH Keywords: stable marriage problem
zbMATH Keywords: matching
zbMATH Keywords: blocking pair
zbMATH Keywords: convergence
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Courtship and linear programming
cites work: College Admissions and the Stability of Marriage
cites work: Q3995616
cites work: Q4130997
cites work: Stable marriage assignment for unequal sets
cites work: Q3999327
cites work: Random Paths to Stability in Two-Sided Matching
description: scientific article; zbMATH DE number 822828