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

DOI10.1007/978-3-540-78773-0_49MaRDI QIDQ5458560zbMATH OpenOpenAlexFDO

Authors 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Understanding the generalized median stable matchings
• Median stable matching for college admissions
• Center stable matchings and centers of cover graphs of distributive lattices
• Hard variants of stable marriage.
• On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings

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?)
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage
• Every finite distributive lattice is a set of stable matchings
• Median stable matching for college admissions
• Procedurally fair and stable matching
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Counting Stable Marriages
• The geometry of fractional stable matchings and its applications
• Three Fast Algorithms for Four Problems in Stable Marriage

Cited in

(8)

• Understanding the generalized median stable matchings
• Deferred acceptance with compensation chains
• Finding a Level Ideal of a Poset
• On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings
• Center stable matchings and centers of cover graphs of distributive lattices
• Median stable matching for college admissions
• A fair procedure in a marriage market
• Stable roommates matchings, mirror posets, median graphs, and the local/global median phenomenon in stable matchings

This page was built for publication: The Generalized Median Stable Matchings: Finding Them Is Not That Easy

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