Maximally satisfying lower quotas in the hospitals/residents problem with ties

DOI10.4230/LIPICS.STACS.2022.31MaRDI QIDQ6490979zbMATH OpenFDO

Authors Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.31

zbMATH Keywords

approximation algorithmhospitals/residents problemlower quotaNP-hardnessstable matchingstrategy-proofness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• A unified model of congestion games with priorities. Two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
• A unified model of congestion games with priorities: two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria

This page was built for publication: Maximally satisfying lower quotas in the hospitals/residents problem with ties

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