@InProceedings{hamada_et_al:LIPIcs.ISAAC.2019.9,
author = {Hamada, Koki and Miyazaki, Shuichi and Yanagisawa, Hiroki},
title = {{Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.9},
URN = {urn:nbn:de:0030-drops-115059},
doi = {10.4230/LIPIcs.ISAAC.2019.9},
annote = {Keywords: Stable marriage problem, strategy-proofness, approximation algorithm, ties, incomplete lists}
}