Stable allocations and partially ordered sets

DOI10.1016/J.DISOPT.2022.100731MaRDI QIDQ2684044zbMATH OpenOpenAlexFDO

Authors 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

order polytopepartially ordered setstable allocationsstable matching

Mathematics Subject Classification ID

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

Recommendations

• The Stable Allocation (or Ordinal Transportation) Problem
• The stable admissions polytope
• Stable Matchings, Optimal Assignments, and Linear Programming
• Finding a stable allocation in polymatroid intersection
• On the stable marriage polytope

Cites work

• Affinely representable lattices, stable matchings, and choice functions
• Characterization of stable matchings as extreme points of a polytope
• College Admissions and the Stability of Marriage
• Faster algorithms for stable allocation problems
• Finding all stable pairs and solutions to the many-to-many stable matching problem
• From One Stable Marriage to the Next: How Long Is the Way?
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• Linear programming brings marital bliss
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• On the stable b-matching polytope.
• On the stable marriage polytope
• Polyhedral aspects of stable marriage
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• Rings of sets
• The Complexity of Counting Stable Marriages
• The diameter of the stable marriage polytope: bounding from below
• The geometry of fractional stable matchings and its applications
• The stable b-matching polytope revisited
• The Stable Allocation (or Ordinal Transportation) Problem
• The Transitive Reduction of a Directed Graph
• Three Fast Algorithms for Four Problems in Stable Marriage
• Two poset polytopes

Cited in

(11)

• Ordinal efficiency and dominated sets of assignments.
• On the stable b-matching polytope.
• The stable admissions polytope
• A coloring property for stable allocations
• Finding a stable allocation in polymatroid intersection
• Finding a stable allocation in polymatroid intersection
• The Stable Allocation (or Ordinal Transportation) Problem
• On the set of stable matchings in a bipartite graph
• Stability of an allocation of objects
• On stable assignments generated by choice functions of mixed type
• Stable matchings, choice functions, and linear orders

This page was built for publication: Stable allocations and partially ordered sets

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