Blum, A, Dickerson, JP, Haghtalab, N, Procaccia, AD, Sandholm, T, and Sharma, A. Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries. Retrieved from https://par.nsf.gov/biblio/10113981. Operations research .
Blum, A, Dickerson, JP, Haghtalab, N, Procaccia, AD, Sandholm, T, & Sharma, A. Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries. Operations research, (). Retrieved from https://par.nsf.gov/biblio/10113981.
Blum, A, Dickerson, JP, Haghtalab, N, Procaccia, AD, Sandholm, T, and Sharma, A.
"Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries". Operations research (). Country unknown/Code not available. https://par.nsf.gov/biblio/10113981.
@article{osti_10113981,
place = {Country unknown/Code not available},
title = {Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries},
url = {https://par.nsf.gov/biblio/10113981},
abstractNote = {},
journal = {Operations research},
author = {Blum, A and Dickerson, JP and Haghtalab, N and Procaccia, AD and Sandholm, T and Sharma, A},
}
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.