{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:41:42Z","timestamp":1767339702836,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229016","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Combinatorial auctions with restricted complements"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Microsoft Research, Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Babaioff","sequence":"additional","affiliation":[{"name":"Microsoft Research, Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaddin","family":"Dughmi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064013"},{"volume-title":"Algorithmic Game Theory (Noam Nisan","author":"Blumrosen L.","key":"e_1_3_2_1_3_1","unstructured":"Blumrosen , L. and Nisan , N . 2007 . In Algorithmic Game Theory (Noam Nisan ,Tim Roughgarden, Eva Tardos and Vijay Vazirani(Editors)). Combinatorial Auctions (a survey). CambridgeUniversity Press . Blumrosen, L. and Nisan, N.2007. In Algorithmic Game Theory (Noam Nisan,Tim Roughgarden, Eva Tardos and Vijay Vazirani(Editors)). Combinatorial Auctions (a survey). CambridgeUniversity Press."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1257\/mic.2.1.39"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1687"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10033"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0335-0"},{"key":"e_1_3_2_1_9_1","unstructured":"Conitzer V. Sandholm T. and Santi P. 2005. Combinatorial auctions with k-wise dependent valuations. In AAAI. 248--254.   Conitzer V. Sandholm T. and Santi P. 2005. Combinatorial auctions with k-wise dependent valuations. In AAAI. 248--254."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Cramton P. Shoham Y. and Steinberg R. 2006. Combinatorial Auctions. MIT Press.   Cramton P. Shoham Y. and Steinberg R. 2006. Combinatorial Auctions. MIT Press.","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2003.09.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.42"},{"key":"e_1_3_2_1_13_1","unstructured":"Dobzinski S. Fu H. and Kleinberg R. 2010. Truthfulness via proxies. CoRR abs\/1011.3232.  Dobzinski S. Fu H. and Kleinberg R. 2010. Truthfulness via proxies. CoRR abs\/1011.3232."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993657"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680977"},{"volume-title":"Recent progress in submodularfunction minimization","author":"Fleischer L.","key":"e_1_3_2_1_16_1","unstructured":"Fleischer , L. 2000. Recent progress in submodularfunction minimization . Mathematical Programming SocietyNewsletter , OPTIMA64. Fleischer, L. 2000. Recent progress in submodularfunction minimization. Mathematical Programming SocietyNewsletter, OPTIMA64."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1257\/mic.2.3.160"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585268"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2011.v007a005"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_18"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"volume-title":"Putting Auction Theory toWork","author":"Milgrom P.","key":"e_1_3_2_1_23_1","unstructured":"Milgrom , P. 2004. Putting Auction Theory toWork . Cambridge University Press . Milgrom, P. 2004. Putting Auction Theory toWork. Cambridge University Press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622606.1622608"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380839"}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Valencia Spain","acronym":"EC '12"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229016","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":28,"alternative-id":["10.1145\/2229012.2229016","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229016","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}