{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:33Z","timestamp":1767339273214,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T00:00:00Z","timestamp":1469059200000},"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":[[2016,7,21]]},"DOI":"10.1145\/2940716.2940735","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T15:20:09Z","timestamp":1469114409000},"page":"251-267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Simple Mechanisms for Agents with Complements"],"prefix":"10.1145","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ophir","family":"Friedler","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Morgenstern","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Reiner","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229016"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_3_2_1_3_1","first-page":"178","article-title":"A d\/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs","volume":"7","author":"Berman Piotr","year":"2000","unstructured":"Piotr Berman . 2000 . A d\/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs . Nord. J. Comput. 7 , 3 (2000), 178 -- 184 . Piotr Berman. 2000. A d\/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nord. J. Comput. 7, 3 (2000), 178--184.","journal-title":"Nord. J. Comput."},{"volume-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Braverman Mark","key":"e_1_3_2_1_4_1","unstructured":"Mark Braverman , Jieming Mao , and S. Matthew Weinberg . 2016. Interpolating Between Truthful and Non-Truthful Mechanisms for Combinatorial Auctions . In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , Arlington, Virginia, 1444--1457. Mark Braverman, Jieming Mao, and S. Matthew Weinberg. 2016. Interpolating Between Truthful and Non-Truthful Mechanisms for Combinatorial Auctions. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Arlington, Virginia, 1444--1457."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602877"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_67"},{"volume-title":"Combinatorial auctions","author":"Cramton Peter C","key":"e_1_3_2_1_9_1","unstructured":"Peter C Cramton , Yoav Shoham , and Richard Steinberg . 2006. Combinatorial auctions . Vol. 475 . MIT press Cambridge , Cambridge, MA, USA . Peter C Cramton, Yoav Shoham, and Richard Steinberg. 2006. Combinatorial auctions. Vol. 475. MIT press Cambridge, Cambridge, MA, USA."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_11"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764484"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722138"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132607"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2887007.2887128"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422466"},{"key":"e_1_3_2_1_18_1","volume-title":"Simple Auctions For Agents With Complements. arXiv preprint arXiv:1603.07939","author":"Feldman Michal","year":"2016","unstructured":"Michal Feldman , Ophir Friedler , Jamie Morgenstern , and Guy Reiner . 2016. Simple Auctions For Agents With Complements. arXiv preprint arXiv:1603.07939 ( 2016 ). Michal Feldman, Ophir Friedler, Jamie Morgenstern, and Guy Reiner. 2016. Simple Auctions For Agents With Complements. arXiv preprint arXiv:1603.07939 (2016)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488634"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45046-4_14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993619"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095186"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873647"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764506"},{"key":"e_1_3_2_1_27_1","unstructured":"Jamie Morgenstern. 2015. Market Algorithms: Incentives Learning and Privacy. Ph.D. Dissertation. Carnegie Mellon University.  Jamie Morgenstern. 2015. Market Algorithms: Incentives Learning and Privacy. Ph.D. Dissertation. Carnegie Mellon University."},{"volume-title":"Advances in Neural Information Processing Systems","author":"Morgenstern Jamie H","key":"e_1_3_2_1_28_1","unstructured":"Jamie H Morgenstern and Tim Roughgarden . 2015. On the Pseudo-Dimension of Nearly Optimal Auctions . In Advances in Neural Information Processing Systems . MIT Press , Cambridge, MA, USA , 136--144. Jamie H Morgenstern and Tim Roughgarden. 2015. On the Pseudo-Dimension of Nearly Optimal Auctions. In Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, USA, 136--144."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536485"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764510"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229082"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488635"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Chi-Chih Yao Andrew","year":"2015","unstructured":"Andrew Chi-Chih Yao . 2015 . An n-to-1 bidder reduction for multi-item auctions and its applications . In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , New York, NY, USA, 92--109. Andrew Chi-Chih Yao. 2015. An n-to-1 bidder reduction for multi-item auctions and its applications. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, New York, NY, USA, 92--109."}],"event":{"name":"EC '16: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Maastricht The Netherlands","acronym":"EC '16"},"container-title":["Proceedings of the 2016 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:27Z","timestamp":1750222587000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,21]]},"references-count":34,"alternative-id":["10.1145\/2940716.2940735","10.1145\/2940716"],"URL":"https:\/\/doi.org\/10.1145\/2940716.2940735","relation":{},"subject":[],"published":{"date-parts":[[2016,7,21]]},"assertion":[{"value":"2016-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}