Stable matchings and linear programming

DOI10.1016/0024-3795(95)00052-6MaRDI QIDQ1923201zbMATH OpenOpenAlexWikidataFDO

Authors Hernán G. Abeledo, Yosef Blum

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

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

Recommendations

• Stable matchings and linear inequalities
• Stable Matchings, Optimal Assignments, and Linear Programming
• The geometry of fractional stable matchings and its applications

Cites work

• scientific article; zbMATH DE number 3904331 (Why is no real title available?)
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 477584 (Why is no real title available?)
• A characterization of graphs that ensure the existence of stable matchings
• A new fixed point approach for stable networks and stable marriages
• An efficient algorithm for the “stable roommates” problem
• Characterization of stable matchings as extreme points of a polytope
• College Admissions and the Stability of Marriage
• Homotopy and crossings of systems of curves on a surface
• Linear programming brings marital bliss
• Stable Matchings, Optimal Assignments, and Linear Programming
• Stable matchings and linear inequalities

Cited in

(21)

• On a cutting plane heuristic for the stable roommates problem and its applications
• On stable matchings and flows
• Stable Matching with Uncertain Linear Preferences
• Compromises and rewards: stable and non-manipulable probabilistic matching
• On the set of many-to-one strongly stable fractional matchings
• On the stable b-matching polytope.
• Stable Matchings, Optimal Assignments, and Linear Programming
• Stable matching: An integer programming approach
• Stable matchings and linear inequalities
• Disjoint stable matchings in linear time
• Perfect matching interdiction problem restricted to a stable vertex
• Blockers and antiblockers of stable matchings
• Jointly stable matchings
• Linear programming brings marital bliss
• Stable matching with network externalities
• Polyhedral aspects of stable marriage
• The stable b-matching polytope revisited
• The geometry of fractional stable matchings and its applications
• A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
• An elementary integrality proof of Rothblum's stable matching formulation
• scientific article; zbMATH DE number 4133845 (Why is no real title available?)

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

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