Assadi, Sepehr, Khandeparkar, Hrishikesh, Saxena, Raghuvansh R, and Weinberg, S Matthew. Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. Retrieved from https://par.nsf.gov/biblio/10576135. SIAM Journal on Computing 51.3 Web. doi:10.1137/20M1370021.

Assadi, Sepehr, Khandeparkar, Hrishikesh, Saxena, Raghuvansh R, & Weinberg, S Matthew. Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. SIAM Journal on Computing, 51 (3). Retrieved from https://par.nsf.gov/biblio/10576135. https://doi.org/10.1137/20M1370021

Assadi, Sepehr, Khandeparkar, Hrishikesh, Saxena, Raghuvansh R, and Weinberg, S Matthew. "Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions". SIAM Journal on Computing 51 (3). Country unknown/Code not available: SIAM. https://doi.org/10.1137/20M1370021. https://par.nsf.gov/biblio/10576135.

@article{osti_10576135,
place = {Country unknown/Code not available}, title = {Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions}, url = {https://par.nsf.gov/biblio/10576135}, DOI = {10.1137/20M1370021}, abstractNote = {}, journal = {SIAM Journal on Computing}, volume = {51}, number = {3}, publisher = {SIAM}, author = {Assadi, Sepehr and Khandeparkar, Hrishikesh and Saxena, Raghuvansh R and Weinberg, S Matthew}, }