Understanding the generalized median stable matchings

DOI10.1007/s00453-009-9307-2zbMath1204.68142OpenAlexW2098850032MaRDI QIDQ1959721

Christine T. Cheng

Publication date: 7 October 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9307-2

zbMATH Keywords

stable matchingscounting closed subsets or antichainsfair stable matchingsmedians in distributive lattices

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings ⋮ Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function ⋮ Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case ⋮ Fair-by-design matching ⋮ Local search approaches in stable matching problems ⋮ Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices ⋮ Sex-equal stable matchings: complexity and exact algorithms ⋮ Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Medians in median graphs
• Every finite distributive lattice is a set of stable matchings
• A unified approach to finding good stable matchings in the hospitals/residents setting
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• Median stable matching for college admissions
• The Geometry of Fractional Stable Matchings and Its Applications
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Single Machine Scheduling with Precedence Constraints of Dimension 2
• Medians and Majorities in Semimodular Lattices
• The Complexity of Counting Stable Marriages
• Searching in Trees, Series-Parallel and Interval Orders
• Three Fast Algorithms for Four Problems in Stable Marriage
• Searching in 2-dimensional partial orders
• Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications
• Stable networks and product graphs
• The Generalized Median Stable Matchings: Finding Them Is Not That Easy
• A Fixed-Point Approach to Stable Matchings and Some Applications
• A ternary operation in distributive lattices
• College Admissions and the Stability of Marriage

This page was built for publication: Understanding the generalized median stable matchings