Socially Stable Matchings in the Hospitals/Residents Problem
From MaRDI portal
Publication:2842147
DOI10.1007/978-3-642-40104-6_8zbMath1394.91300arXiv1303.2041OpenAlexW2104372291MaRDI QIDQ2842147
Georgios Askalidis, David F. Manlove, Augustine Kwanashie, Nicole Immorlica, Emmanouil Pountourakis
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.2041
Related Items (10)
Two problems in max-size popular matchings ⋮ Computing relaxations for the three-dimensional stable matching problem with cyclic preferences ⋮ Improved approximation algorithms for two variants of the stable marriage problem with ties ⋮ Locally Stable Marriage with Strict Preferences ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ PROM: efficient matching query processing on high-dimensional data ⋮ Stable marriage and roommates problems with restricted edges: complexity and approximability ⋮ (Un)stable matchings with blocking costs ⋮ Unnamed Item ⋮ The stable marriage problem with ties and restricted edges
This page was built for publication: Socially Stable Matchings in the Hospitals/Residents Problem