Transformation from arbitrary matchings to stable matchings

DOI10.1016/0097-3165(93)90051-9MaRDI QIDQ1803876zbMATH OpenOpenAlexFDO

Authors Akihisa Tamura

Publication date 29 June 1993

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(93)90051-9

zbMATH Keywords

algorithmtransformationcyclingstable matching

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)

Recommendations

• Bistable versions of the marriages and roommates problems
• Stable matching problems with exchange restrictions
• Rotations in the stable \(b\)-matching problem
• Random Paths to Stability in Two-Sided Matching
• Stable marriage and indifference

Cites work

• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)
• College Admissions and the Stability of Marriage

Cited in

(5)

• Analysis of stochastic matching markets
• The myopic stable set for social environments
• Paths to stability and uniqueness in two-sided matching markets
• Designing rotation programs: limits and possibilities
• A characterization of absorbing sets in coalition formation games

This page was built for publication: Transformation from arbitrary matchings to stable matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803876)