{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:16Z","timestamp":1763468116582,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482569","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"123-140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Harnessing the power of two crossmatches"],"prefix":"10.1145","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Procaccia","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Sharma","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"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\/1807342.1807392"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ashlagi I. Gamarnik D. Rees M. A. and Roth A. E. 2012. The need for (long) chains in kidney exchange. NBER Working Paper Series No. 18202.  Ashlagi I. Gamarnik D. Rees M. A. and Roth A. E. 2012. The need for (long) chains in kidney exchange. NBER Working Paper Series No. 18202.","DOI":"10.3386\/w18202"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993625"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9511-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_69"},{"volume-title":"Proc. of 26th AAAI. 1340--1346","author":"Dickerson J. P.","key":"e_1_3_2_1_10_1","unstructured":"Dickerson , J. P. , Procaccia , A. D. , and Sandholm , T . 2012a. Dynamic matching via weighted myopia with application to kidney exchange . In Proc. of 26th AAAI. 1340--1346 . Dickerson, J. P., Procaccia, A. D., and Sandholm, T. 2012a. Dynamic matching via weighted myopia with application to kidney exchange. In Proc. of 26th AAAI. 1340--1346."},{"volume-title":"Proc. of 11th AAMAS. 711--718","author":"Dickerson J. P.","key":"e_1_3_2_1_11_1","unstructured":"Dickerson , J. P. , Procaccia , A. D. , and Sandholm , T . 2012b. Optimizing kidney exchange with transplant chains: Theory and reality . In Proc. of 11th AAMAS. 711--718 . Dickerson, J. P., Procaccia, A. D., and Sandholm, T. 2012b. Optimizing kidney exchange with transplant chains: Theory and reality. In Proc. of 11th AAMAS. 711--718."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482596"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"e_1_3_2_1_14_1","unstructured":"Molinaro M. and Ravi R. 2011. The query-commit problem. CoRR abs\/1110.0990.  Molinaro M. and Ravi R. 2011. The query-commit problem. CoRR abs\/1110.0990."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.3.828"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993626"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-937X.2009.00575.x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1097\/00007890-200108270-00015"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":18,"alternative-id":["10.1145\/2492002.2482569","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482569","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}