@InProceedings{goko_et_al:LIPIcs.STACS.2022.31,
  author =	{Goko, Hiromichi and Makino, Kazuhisa and Miyazaki, Shuichi and Yokoi, Yu},
  title =	{{Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties}},
  booktitle =	{39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
  pages =	{31:1--31:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-222-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{219},
  editor =	{Berenbrink, Petra and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.31},
  URN =		{urn:nbn:de:0030-drops-158414},
  doi =		{10.4230/LIPIcs.STACS.2022.31},
  annote =	{Keywords: Stable matching, Hospitals/Residents problem, Lower quota, NP-hardness, Approximation algorithm, Strategy-proofness}
}