Transformation from arbitrary matchings to stable matchings

DOI10.1016/0097-3165(93)90051-9zbMath0771.05096OpenAlexW2088548400MaRDI QIDQ1803876

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

algorithmtransformationstable matchingcycling

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)

Related Items (5)

Analysis of stochastic matching markets ⋮ Designing rotation programs: limits and possibilities ⋮ Locally Stable Marriage with Strict Preferences ⋮ Paths to stability and uniqueness in two-sided matching markets ⋮ The Myopic Stable Set for Social Environments

Cites Work

• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item

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