Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach

DOI10.1287/ijoc.2022.1237OpenAlexW4298110042MaRDI QIDQ5060805

Hoda Atef Yekta, Pitchaya Wiratchotisatian, Andrew C. Trapp

Publication date: 11 January 2023

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2022.1237

zbMATH Keywords

computational optimizationinteger optimizationmany-to-one stable matching

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• Gurobi
• NumPy
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Best subset selection via a modern optimization lens
• Integer programming methods for special college admissions problems
• The college admissions problem is not equivalent to the marriage problem
• Linear programming brings marital bliss
• Top dominance and the possibility of strategy-proof stable solutions to matching problems
• The stable admissions polytope
• Mathematical models for stable matching problems with ties and incomplete lists
• On cores and indivisibility
• The ``Boston school-choice mechanism: an axiomatic approach
• A Constraint Programming Approach to the Hospitals / Residents Problem
• The College Admissions Problem Revisited
• The Economics of Matching: Stability and Incentives
• Stable Matchings, Optimal Assignments, and Linear Programming
• Placement Optimization in Refugee Resettlement
• College Admissions and the Stability of Marriage

This page was built for publication: Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach