{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T14:44:31Z","timestamp":1772030671368,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060681","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"610-618","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":79,"title":["Approximation algorithms for combinatorial auctions with complement-free bidders"],"prefix":"10.1145","author":[{"given":"Shahar","family":"Dobzinski","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA)","author":"Archer Aaron","year":"2003","unstructured":"Aaron Archer , Christos Papadimitriou , Kunal Talwar , and Eva Tardos . An approximate truthful mechanism for combinatorial auctions with single parameter agent . In Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA) , 2003 . Aaron Archer, Christos Papadimitriou, Kunal Talwar, and Eva Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agent. In Proceedings of the 14th Annual ACM Symposium on Discrete Algorithms (SODA), 2003."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/846241.846250"},{"key":"e_1_3_2_1_3_1","unstructured":"Alejandro Bertelsen and Daniel Lehmann. Substitutes valuations: M#-concavity. Working Paper.  Alejandro Bertelsen and Daniel Lehmann. Substitutes valuations: M#-concavity. Working Paper."},{"key":"e_1_3_2_1_4_1","volume-title":"On the computational power of iterative auctions I: Demand queries","author":"Blumrosen Liad","year":"2005","unstructured":"Liad Blumrosen and Noam Nisan . On the computational power of iterative auctions I: Demand queries , 2005 . Working paper. Liad Blumrosen and Noam Nisan. On the computational power of iterative auctions I: Demand queries, 2005. Working paper."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262033428.001.0001","volume-title":"Combinatorial Auctions","author":"Cramton Peter","year":"2005","unstructured":"Peter Cramton , Yoav Shoham , and Richard Steinberg (Editors). Combinatorial Auctions . MIT Press . Forthcoming., 2005 . http:\/\/www.cramton.umd.edu\/papers2000-2004\/cramton-shoham-steinberg-combinatorial-auctions.pdf. Peter Cramton, Yoav Shoham, and Richard Steinberg (Editors). Combinatorial Auctions. MIT Press. Forthcoming., 2005. http:\/\/www.cramton.umd.edu\/papers2000-2004\/cramton-shoham-steinberg-combinatorial-auctions.pdf."},{"key":"e_1_3_2_1_6_1","volume-title":"Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions","author":"Dobzinski Shahar","year":"2005","unstructured":"Shahar Dobzinski and Michael Schapira . Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions , 2005 . Working paper. Shahar Dobzinski and Michael Schapira. Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions, 2005. Working paper."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258536"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0899-8256(03)00184-2"},{"key":"e_1_3_2_1_12_1","volume-title":"Inapproximability results for combinatorial auctions with submodular utility functions","author":"Khot Subhash","year":"2005","unstructured":"Subhash Khot , Richard Lipton , Evangelos Markakis , and Aranyak Mehta . Inapproximability results for combinatorial auctions with submodular utility functions , 2005 . Working paper. Subhash Khot, Richard Lipton, Evangelos Markakis, and Aranyak Mehta. Inapproximability results for combinatorial auctions with submodular utility functions, 2005. Working paper."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501161"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684594"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129772"},{"key":"e_1_3_2_1_18_1","volume-title":"Combinatorial Auctions. MIT Press. Forthcoming","author":"Nisan Noam","year":"2005","unstructured":"Noam Nisan . Chapter 9 : Bidding Languages. In P. Cramton and Y. Shoham and R. Steinberg (Editors) , Combinatorial Auctions. MIT Press. Forthcoming , 2005 . Available from http:\/\/www.cs.huji.ac.il\/~noam\/mkts.html. Noam Nisan. Chapter 9: Bidding Languages. In P. Cramton and Y. Shoham and R. Steinberg (Editors), Combinatorial Auctions. MIT Press. Forthcoming, 2005. Available from http:\/\/www.cs.huji.ac.il\/~noam\/mkts.html."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352898"},{"key":"e_1_3_2_1_20_1","volume-title":"The communication requirements of efficient allocations and supporting prices","author":"Nisan Noam","year":"2003","unstructured":"Noam Nisan and Ilya Segal . The communication requirements of efficient allocations and supporting prices , 2003 . Working paper. Available from http:\/\/www.cs.huji.ac.il\/~noam\/mkts.html. Noam Nisan and Ilya Segal. The communication requirements of efficient allocations and supporting prices, 2003. Working paper. Available from http:\/\/www.cs.huji.ac.il\/~noam\/mkts.html."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509996"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3485"}],"event":{"name":"STOC05: Symposium on Theory of Computing","location":"Baltimore MD USA","acronym":"STOC05","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:28:28Z","timestamp":1673166508000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":24,"alternative-id":["10.1145\/1060590.1060681","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060681","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}