Stable matchings and linear programming

DOI10.1016/0024-3795(95)00052-6zbMath0858.90093OpenAlexW2022412414WikidataQ114852063 ScholiaQ114852063MaRDI QIDQ1923201

Yosef Blum, Hernán G. Abeledo

Publication date: 7 October 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00052-6

zbMATH Keywords

fractional stable matchingsnonbipartite stable matching problemspolyhedral perspective

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Individual preferences (91B08)

Related Items (6)

Stable matching with network externalities ⋮ On the stable \(b\)-matching polytope. ⋮ Compromises and rewards: stable and non-manipulable probabilistic matching ⋮ On the set of many-to-one strongly stable fractional matchings ⋮ On a cutting plane heuristic for the stable roommates problem and its applications ⋮ Polyhedral Aspects of Stable Marriage

Cites Work

• Homotopy and crossings of systems of curves on a surface
• Linear programming brings marital bliss
• A characterization of graphs that ensure the existence of stable matchings
• Characterization of stable matchings as extreme points of a polytope
• A new fixed point approach for stable networks and stable marriages
• Stable matchings and linear inequalities
• An efficient algorithm for the “stable roommates” problem
• Stable Matchings, Optimal Assignments, and Linear Programming
• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stable matchings and linear programming