The Generalized Median Stable Matchings: Finding Them Is Not That Easy
DOI10.1007/978-3-540-78773-0_49zbMATH Open1136.68451OpenAlexW1571542312MaRDI QIDQ5458560FDOQ5458560
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
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
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)
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Every finite distributive lattice is a set of stable matchings
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Median stable matching for college admissions
- The geometry of fractional stable matchings and its applications
- Procedurally fair and stable matching
Cited In (8)
- Deferred acceptance with compensation chains
- Understanding the generalized median stable matchings
- Center stable matchings and centers of cover graphs of distributive lattices
- On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings
- A fair procedure in a marriage market
- Median stable matching for college admissions
- Stable roommates matchings, mirror posets, median graphs, and the local/global median phenomenon in stable matchings
- Finding a Level Ideal of a Poset
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)
