Understanding the generalized median stable matchings

DOI10.1007/S00453-009-9307-2zbMATH Open1204.68142OpenAlexW2098850032MaRDI QIDQ1959721FDOQ1959721

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• 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
• Medians and Majorities in Semimodular Lattices
• Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications
• A ternary operation in distributive lattices
• Medians in median graphs
• Stable networks and product graphs
• Searching in Trees, Series-Parallel and Interval Orders
• Single Machine Scheduling with Precedence Constraints of Dimension 2
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• A unified approach to finding good stable matchings in the hospitals/residents setting
• Searching in 2-dimensional partial orders
• The Generalized Median Stable Matchings: Finding Them Is Not That Easy

Cited In (10)

• Fair-by-design matching
• 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
• A fair procedure in a marriage market
• Finding all stable pairs and solutions to the many-to-many stable matching problem
• Local search approaches in stable matching problems
• Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
• Finding all stable matchings with assignment constraints
• Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
• Sex-equal stable matchings: complexity and exact algorithms

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

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