{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:04Z","timestamp":1781077744893,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T00:00:00Z","timestamp":1434326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000850","name":"American Society for Engineering Education","doi-asserted-by":"publisher","award":["NDSEG Fellowship"],"award-info":[{"award-number":["NDSEG Fellowship"]}],"id":[{"id":"10.13039\/100000850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["Sloan Research Fellowship"],"award-info":[{"award-number":["Sloan Research Fellowship"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1101668, CCF-1116892, CCF-1215883, CCF-1415460, IIS-0964579, IIS-1065251, IIS-1320620, IIS-1350598"],"award-info":[{"award-number":["CCF-1101668, CCF-1116892, CCF-1215883, CCF-1415460, IIS-0964579, IIS-1065251, IIS-1320620, IIS-1350598"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,15]]},"DOI":"10.1145\/2764468.2764479","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"325-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Ignorance is Almost Bliss"],"prefix":"10.1145","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[{"name":"CMU, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John P.","family":"Dickerson","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nika","family":"Haghtalab","sequence":"additional","affiliation":[{"name":"CMU, pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel D.","family":"Procaccia","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ankit","family":"Sharma","sequence":"additional","affiliation":[{"name":"Solvvy Inc., Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250954"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.05.007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602887"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1925--1933","author":"Anderson R.","unstructured":"Anderson , R. , Ashlagi , I. , Gamarnik , D. , and Kanoria , Y . 2015a. A dynamic model of barter exchange . In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1925--1933 . Anderson, R., Ashlagi, I., Gamarnik, D., and Kanoria, Y. 2015a. A dynamic model of barter exchange. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1925--1933."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1421853112"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_53"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Ashlagi I. Gamarnik D. Rees M. A. and Roth A. E. 2011. The need for (long) chains in kidney exchange. Manuscript.  Ashlagi I. Gamarnik D. Rees M. A. and Roth A. E. 2011. The need for (long) chains in kidney exchange. Manuscript.","DOI":"10.3386\/w18202"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482565"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993625"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI). 405--411","author":"Awasthi P.","unstructured":"Awasthi , P. and Sandholm , T . 2009. Online stochastic optimization in the large: Application to kidney exchange . In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI). 405--411 . Awasthi, P. and Sandholm, T. 2009. Online stochastic optimization in the large: Application to kidney exchange. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI). 405--411."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9511-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482569"},{"key":"e_1_3_2_1_13_1","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","unstructured":"Bollob\u00e1s , B. 2001. Random Graphs 2 nd Ed. Cambridge University Press . Bollob\u00e1s, B. 2001. Random Graphs 2nd Ed. Cambridge University Press.","edition":"2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.05.025"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_69"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.15"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI). 1340--1346","author":"Dickerson J. P.","unstructured":"Dickerson , J. P. , Procaccia , A. D. , and Sandholm , T . 2012a. Dynamic matching via weighted myopia with application to kidney exchange . In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI). 1340--1346 . Dickerson, J. P., Procaccia, A. D., and Sandholm, T. 2012a. Dynamic matching via weighted myopia with application to kidney exchange. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI). 1340--1346."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 711--718","author":"Dickerson J. P.","unstructured":"Dickerson , J. P. , Procaccia , A. D. , and Sandholm , T . 2012b. Optimizing kidney exchange with transplant chains: Theory and reality . In Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 711--718 . Dickerson, J. P., Procaccia, A. D., and Sandholm, T. 2012b. Optimizing kidney exchange with transplant chains: Theory and reality. In Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 711--718."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482596"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI).","author":"Dickerson J. P.","unstructured":"Dickerson , J. P. and Sandholm , T . 2015. FutureMatch: Combining human value judgments and machine learning to match in dynamic environments . In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI). Dickerson, J. P. and Sandholm, T. 2015. FutureMatch: Combining human value judgments and machine learning to match in dynamic environments. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_1_22_1","unstructured":"F\u00fcrer M. and Yu H. 2013. Approximate the k-set packing problem by local improvements. CoRR abs\/1307.2262.  F\u00fcrer M. and Yu H. 2013. Approximate the k-set packing problem by local improvements. CoRR abs\/1307.2262."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2014.0496"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.19"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1522--1538","author":"Gupta A.","unstructured":"Gupta , A. , Krishnaswamy , R. , Nagarajan , V. , and Ravi , R . 2012. Approximation algorithms for stochastic orienteering . In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1522--1538 . Gupta, A., Krishnaswamy, R., Nagarajan, V., and Ravi, R. 2012. Approximation algorithms for stochastic orienteering. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1522--1538."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402008"},{"key":"e_1_3_2_1_28_1","volume-title":"American Transplant Congress (ATC). Talk abstract.","author":"Leishman R.","unstructured":"Leishman , R. , Formica , R. , Andreoni , K. , Friedewald , J. , Sleeman , E. , Monstello , C. , Stewart , D. , and Sandholm , T . 2013. The Organ Procurement and Transplantation Network (OPTN) Kidney Paired Donation Pilot Program (KPDPP): Review of current results . In American Transplant Congress (ATC). Talk abstract. Leishman, R., Formica, R., Andreoni, K., Friedewald, J., Sleeman, E., Monstello, C., Stewart, D., and Sandholm, T. 2013. The Organ Procurement and Transplantation Network (OPTN) Kidney Paired Donation Pilot Program (KPDPP): Review of current results. In American Transplant Congress (ATC). Talk abstract."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670129"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1162\/0033553041382157"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.04.004"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.3.828"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1097\/01.tp.0000195775.77081.25"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-937X.2009.00575.x"}],"event":{"name":"EC '15: ACM Conference on Economics and Computation","location":"Portland Oregon USA","acronym":"EC '15","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the Sixteenth ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764479","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764468.2764479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:19Z","timestamp":1750273459000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764479"}},"subtitle":["Near-Optimal Stochastic Matching With Few Queries"],"short-title":[],"issued":{"date-parts":[[2015,6,15]]},"references-count":34,"alternative-id":["10.1145\/2764468.2764479","10.1145\/2764468"],"URL":"https:\/\/doi.org\/10.1145\/2764468.2764479","relation":{},"subject":[],"published":{"date-parts":[[2015,6,15]]},"assertion":[{"value":"2015-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}