Maximum locally stable matchings

DOI10.3390/a6030383zbMath1461.91194OpenAlexW2049562645MaRDI QIDQ1736563

Christine T. Cheng, Eric J. McDermid

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

social networksstable matchingshospital/residents problem

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Related Items (4)

Locally Stable Marriage with Strict Preferences ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ Editorial: Special issue on matching under preferences ⋮ Local stability constraints

Cites Work

• Unnamed Item
• Better and simpler approximation algorithms for the stable marriage problem
• Size versus stability in the marriage problem
• The stable marriage problem with master preference lists
• Some remarks on the stable matching problem
• Faster and Simpler Approximation of Stable Matchings
• Rank-maximal matchings
• Locally Stable Marriage with Strict Preferences
• Local Matching Dynamics in Social Networks
• Popular Matchings
• The importance of being biased
• Improved approximation results for the stable marriage problem
• Weighted Popular Matchings
• A 3/2-Approximation Algorithm for General Stable Marriage
• Popular Matchings with Variable Job Capacities
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• College Admissions and the Stability of Marriage

This page was built for publication: Maximum locally stable matchings