(Un)stable matchings with blocking costs

DOI10.1016/j.orl.2021.07.005OpenAlexW3182337489MaRDI QIDQ2060342

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)

Cites Work

• Unnamed Item
• Size versus stability in the marriage problem
• An improved approximation lower bound for finding almost stable maximum matchings
• House allocation with existing tenants
• Popular matchings in the stable marriage problem
• Socially Stable Matchings in the Hospitals/Residents Problem
• The Complexity of Counting Stable Marriages
• College Admissions and the Stability of Marriage

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