Improving man-optimal stable matchings by minimum change of preference lists

DOI10.3390/a6020371zbMath1461.68088OpenAlexW2150787783MaRDI QIDQ1736562

Takashi Nagase, Robert W. Irving, Shuichi Miyazaki, Kazuo Iwama, Takao Inoshita

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6020371

zbMATH Keywords

combinatorial optimizationstable marriage problempolynomial-time algorithmsman-optimal stable matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Matching models (91B68)

Related Items (3)

Strategic issues in college admissions with score-limits ⋮ Editorial: Special issue on matching under preferences ⋮ Balanced stable marriage: how close is close enough?

Cites Work

• Unnamed Item
• Detecting high log-densities
• Faster Scaling Algorithms for Network Problems
• Finding Dense Subgraphs of Sparse Graphs
• Cheating by Men in the Gale-Shapley Stable Matching Algorithm
• College Admissions and the Stability of Marriage

This page was built for publication: Improving man-optimal stable matchings by minimum change of preference lists