Vazirani, Vijay V, and Yannakakis, Mihalis. Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. Retrieved from https://par.nsf.gov/biblio/10225568. 12th Innovations in Theoretical Computer Science Conference . Web. doi:10.4230/LIPIcs.ITCS.2021.59.
Vazirani, Vijay V, and Yannakakis, Mihalis.
"Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets". 12th Innovations in Theoretical Computer Science Conference (). Country unknown/Code not available. https://doi.org/10.4230/LIPIcs.ITCS.2021.59.https://par.nsf.gov/biblio/10225568.
@article{osti_10225568,
place = {Country unknown/Code not available},
title = {Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets},
url = {https://par.nsf.gov/biblio/10225568},
DOI = {10.4230/LIPIcs.ITCS.2021.59},
abstractNote = {},
journal = {12th Innovations in Theoretical Computer Science Conference},
author = {Vazirani, Vijay V and Yannakakis, Mihalis},
editor = {null}
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.