The Generalized Median Stable Matchings: Finding Them Is Not That Easy

DOI10.1007/978-3-540-78773-0_49zbMath1136.68451OpenAlexW1571542312MaRDI QIDQ5458560

Christine T. Cheng

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_49

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Finding a Level Ideal of a Poset ⋮ Understanding the generalized median stable matchings ⋮ Deferred Acceptance with Compensation Chains

Cites Work

• Unnamed Item
• Unnamed Item
• Every finite distributive lattice is a set of stable matchings
• Median stable matching for college admissions
• Procedurally fair and stable matching
• The Geometry of Fractional Stable Matchings and Its Applications
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage