Characterization of stable matchings as extreme points of a polytope
From MaRDI portal
Publication:1190600
DOI10.1007/BF01586041zbMath0773.90059MaRDI QIDQ1190600
Publication date: 26 September 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (49)
Stable matchings and linear inequalities ⋮ Satisfied two-sided matching: a method considering elation and disappointment of agents ⋮ Characterization of super-stable matchings ⋮ Blockers and antiblockers of stable matchings ⋮ One-node cutsets and the dominating set polytope ⋮ A Polyhedral Description of Kernels ⋮ The object allocation problem with random priorities ⋮ An extendable stable matching algorithm of a kind of bipartite graph ⋮ Integer programming methods for special college admissions problems ⋮ Quasi-Popular Matchings, Optimality, and Extended Formulations ⋮ Canonical monotone decompositions of fractional stable matchings ⋮ Stable matchings and linear programming ⋮ Stable matching: An integer programming approach ⋮ Stable marriages and search frictions ⋮ On the set of stable matchings in a bipartite graph ⋮ Stable allocations and partially ordered sets ⋮ Marriage market with indifferences: a linear programming approach ⋮ On the stable \(b\)-matching polytope. ⋮ An elementary integrality proof of Rothblum's stable matching formulation ⋮ Bistable versions of the marriages and roommates problems ⋮ Existence of stable outcomes and the lattice property for a unified matching market ⋮ Mathematical models for stable matching problems with ties and incomplete lists ⋮ Stable fractional matchings ⋮ The rank pricing problem with ties ⋮ A note on the lattice structure for matching markets via linear programming ⋮ Fractional matching markets ⋮ Stable marriage and roommates problems with restricted edges: complexity and approximability ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ Complexity of the sex-equal stable marriage problem ⋮ Compromises and rewards: stable and non-manipulable probabilistic matching ⋮ On the set of many-to-one strongly stable fractional matchings ⋮ Unnamed Item ⋮ Efficiency and stability of probabilistic assignments in marriage problems ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ Popular edges and dominant matchings ⋮ The stable \(b\)-matching polytope revisited ⋮ A Matroid Approach to Stable Matchings with Lower Quotas ⋮ Maximum stable matching with one-sided ties of bounded length ⋮ Courtship and linear programming ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ A characterization of strongly stable fractional matchings ⋮ Lattice structure of the random stable set in many-to-many matching markets ⋮ Random matching under priorities: stability and no envy concepts ⋮ On a cutting plane heuristic for the stable roommates problem and its applications ⋮ Polyhedral Aspects of Stable Marriage ⋮ Popularity, Mixed Matchings, and Self-Duality ⋮ Unnamed Item ⋮ A polynomial-time algorithm for the bistable roommates problem ⋮ Understanding Popular Matchings via Stable Matchings
Cites Work
This page was built for publication: Characterization of stable matchings as extreme points of a polytope
