Daniela Sabán, Jay Sethuraman. The Complexity of Computing the Random Priority Allocation Matrix. In Yiling Chen, Nicole Immorlica, editors, Web and Internet Economics - 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings. Volume 8289 of Lecture Notes in Computer Science, pages 421, Springer, 2013. [doi]
@inproceedings{SabanS13-0,
title = {The Complexity of Computing the Random Priority Allocation Matrix},
author = {Daniela Sabán and Jay Sethuraman},
year = {2013},
doi = {10.1007/978-3-642-45046-4_34},
url = {http://dx.doi.org/10.1007/978-3-642-45046-4_34},
researchr = {https://researchr.org/publication/SabanS13-0},
cites = {0},
citedby = {0},
pages = {421},
booktitle = {Web and Internet Economics - 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
editor = {Yiling Chen and Nicole Immorlica},
volume = {8289},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-45045-7},
}