@InProceedings{ishizuka_et_al:LIPIcs.ISAAC.2018.11,
author = {Ishizuka, Takashi and Kamiyama, Naoyuki},
title = {{On the Complexity of Stable Fractional Hypergraph Matching}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {11:1--11:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.11},
URN = {urn:nbn:de:0030-drops-99590},
doi = {10.4230/LIPIcs.ISAAC.2018.11},
annote = {Keywords: fractional hypergraph matching, stable matching, PPAD-completeness}
}