Transformation from arbitrary matchings to stable matchings

DOI10.1016/0097-3165(93)90051-9zbMATH Open0771.05096OpenAlexW2088548400MaRDI QIDQ1803876FDOQ1803876

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• College Admissions and the Stability of Marriage

Cited In (5)

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

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)