Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis. Computational Hardness of the Hylland-Zeckhauser Scheme. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 2253-2268, SIAM, 2022. [doi]
@inproceedings{ChenCPY22,
title = {Computational Hardness of the Hylland-Zeckhauser Scheme},
author = {Thomas Chen and Xi Chen and Binghui Peng and Mihalis Yannakakis},
year = {2022},
doi = {10.1137/1.9781611977073.90},
url = {https://doi.org/10.1137/1.9781611977073.90},
researchr = {https://researchr.org/publication/ChenCPY22},
cites = {0},
citedby = {0},
pages = {2253-2268},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}