Stable allocations and partially ordered sets

DOI10.1016/j.disopt.2022.100731OpenAlexW4290078289MaRDI QIDQ2684044

Ioannis Mourtos, Michalis Samaris

Publication date: 16 February 2023

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2022.100731

zbMATH Keywords

partially ordered setstable matchingstable allocationsorder polytope

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Related Items

On the set of stable matchings in a bipartite graph

Cites Work

• Unnamed Item
• Two poset polytopes
• Linear programming brings marital bliss
• Characterization of stable matchings as extreme points of a polytope
• On the stable \(b\)-matching polytope.
• The stable \(b\)-matching polytope revisited
• On the stable marriage polytope
• Faster algorithms for stable allocation problems
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• The diameter of the stable marriage polytope: bounding from below
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• Rings of sets
• The Geometry of Fractional Stable Matchings and Its Applications
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• Polyhedral Aspects of Stable Marriage
• From One Stable Marriage to the Next: How Long Is the Way?
• The Transitive Reduction of a Directed Graph
• The Stable Allocation (or Ordinal Transportation) Problem
• College Admissions and the Stability of Marriage
• Affinely representable lattices, stable matchings, and choice functions