(Un)stable matchings with blocking costs

DOI10.1016/J.ORL.2021.07.005MaRDI QIDQ2060342zbMATH OpenOpenAlexFDO

Authors Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman

Publication date 13 December 2021

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2021.07.005

zbMATH Keywords

stable matchingrotation posetblocking edges

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• scientific article; zbMATH DE number 4133845
• Solutions for the stable roommates problem with payments
• Stability, optimality and manipulation in matching problems with weighted preferences
• Solutions for the stable roommates problem with payments

Cites work

• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• An improved approximation lower bound for finding almost stable maximum matchings
• College Admissions and the Stability of Marriage
• House allocation with existing tenants
• Popular matchings in the stable marriage problem
• Size versus stability in the marriage problem
• Socially stable matchings in the hospitals/residents problem
• The Complexity of Counting Stable Marriages

Cited in

(1)

• On Pareto optimal balanced exchanges

This page was built for publication: (Un)stable matchings with blocking costs

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