{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T17:14:06Z","timestamp":1769879646334,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:00:00Z","timestamp":1497916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google","award":["Focused Award on Algorithms for Large-Scale Data Analysis"],"award-info":[{"award-number":["Focused Award on Algorithms for Large-Scale Data Analysis"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1524062"],"award-info":[{"award-number":["CCF-1524062"]}],"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":[[2017,6,20]]},"DOI":"10.1145\/3033274.3085128","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:21:49Z","timestamp":1497986509000},"page":"591-608","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Approximately Efficient Two-Sided Combinatorial Auctions"],"prefix":"10.1145","author":[{"given":"Riccardo","family":"Colini-Baldeschi","sequence":"first","affiliation":[{"name":"LUISS, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[{"name":"Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Turchetta","sequence":"additional","affiliation":[{"name":"KPMG Italy and University of Oxford, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602843"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386801"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884533"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.04.013"},{"key":"e_1_3_2_2_7_1","volume-title":"Karlin","author":"Deshmukh Kaustubh","year":"2002","unstructured":"Kaustubh Deshmukh , Andrew V. Goldberg , Jason D. Hartline , and Anna R . Karlin . 2002 . Truthful and Competitive Double Auctions. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA). Springer , 361--373. Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, and Anna R. Karlin. 2002. Truthful and Competitive Double Auctions. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA). Springer, 361--373."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_37"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602854"},{"key":"e_1_3_2_2_10_1","first-page":"477","article-title":"Demand Queries with Preprocessing. In Proceedings of the 41st Int'l Colloquium on Automata, Languages, and Programming (ICALP)","volume":"8572","author":"Feige Uriel","year":"2014","unstructured":"Uriel Feige and Shlomo Joseph . 2014 . Demand Queries with Preprocessing. In Proceedings of the 41st Int'l Colloquium on Automata, Languages, and Programming (ICALP) . Springer LNCS 8572 , 477 -- 488 . Uriel Feige and Shlomo Joseph. 2014. Demand Queries with Preprocessing. In Proceedings of the 41st Int'l Colloquium on Automata, Languages, and Programming (ICALP). Springer LNCS 8572, 477--488.","journal-title":"Springer LNCS"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722139"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(89)90128-2"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(92)90091-U"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(83)90048-0"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.2307\/2951506"},{"key":"e_1_3_2_2_19_1","volume-title":"Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation","author":"Sandholm Tuomas","unstructured":"Tuomas Sandholm and Andrew Gilpin . 2004. Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation . Springer , 73--91. Tuomas Sandholm and Andrew Gilpin. 2004. Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation. Springer, 73--91."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/2297496"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00355"},{"key":"e_1_3_2_2_22_1","volume-title":"A Random-Sampling Double-Auction Mechanism. CoRR abs\/1604.06210","author":"Segal-Halevi Erel","year":"2016","unstructured":"Erel Segal-Halevi , Avinatan Hassidim , and Yonatan Aumann . 2016. A Random-Sampling Double-Auction Mechanism. CoRR abs\/1604.06210 ( 2016 ). Erel Segal-Halevi, Avinatan Hassidim, and Yonatan Aumann. 2016. A Random-Sampling Double-Auction Mechanism. CoRR abs\/1604.06210 (2016)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"name":"EC '17: ACM Conference on Economics and Computation","location":"Cambridge Massachusetts USA","acronym":"EC '17","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2017 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3085128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3085128","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033274.3085128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:46Z","timestamp":1750217806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033274.3085128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,20]]},"references-count":23,"alternative-id":["10.1145\/3033274.3085128","10.1145\/3033274"],"URL":"https:\/\/doi.org\/10.1145\/3033274.3085128","relation":{},"subject":[],"published":{"date-parts":[[2017,6,20]]},"assertion":[{"value":"2017-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}