Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices

DOI10.1007/978-3-642-22006-7_57zbMath1334.05114MaRDI QIDQ3012842

Ichiro Suzuki, Christine T. Cheng, Eric J. McDermid

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_57

zbMATH Keywords

fairness; hypercube; center; median; distributive lattice; partially ordered set; stable matching

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

06A07: Combinatorics of partially ordered sets

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

06D05: Structure and representation theory of distributive lattices

91B68: Matching models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every finite distributive lattice is a set of stable matchings
• Distance center and centroid of a median graph
• Generating random elements of finite distributive lattices
• Lattice structures from planar graphs
• Understanding the generalized median stable matchings
• The Geometry of Fractional Stable Matchings and Its Applications
• The Complexity of Approximately Counting Stable Matchings
• Three Fast Algorithms for Four Problems in Stable Marriage
• College Admissions and the Stability of Marriage