{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:41Z","timestamp":1750219781092,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ISF","award":["2185\/19"],"award-info":[{"award-number":["2185\/19"]}]},{"DOI":"10.13039\/100016166","name":"BSA Foundation","doi-asserted-by":"publisher","award":["2021655"],"award-info":[{"award-number":["2021655"]}],"id":[{"id":"10.13039\/100016166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597695","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"153-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplicity in Auctions Revisited: The Primitive Complexity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7066-2005","authenticated-orcid":false,"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1935-5808","authenticated-orcid":false,"given":"Shahar","family":"Dobzinski","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1491-8020","authenticated-orcid":false,"given":"Ron","family":"Kupfer","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Large-Scale Bundle-Size Pricing: A Theoretical Analysis. Operations Research","author":"Abdallah Tarek","year":"2021","unstructured":"Tarek Abdallah , Arash Asadpour , and Josh Reed . 2021. Large-Scale Bundle-Size Pricing: A Theoretical Analysis. Operations Research ( 2021 ). Tarek Abdallah, Arash Asadpour, and Josh Reed. 2021. Large-Scale Bundle-Size Pricing: A Theoretical Analysis. Operations Research (2021)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2018.08.003"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00024"},{"key":"e_1_3_2_1_5_1","volume-title":"The menu-size complexity of revenue approximation. Games and Economic Behavior","author":"Babaioff Moshe","year":"2021","unstructured":"Moshe Babaioff , Yannai A Gonczarowski , and Noam Nisan . 2021. The menu-size complexity of revenue approximation. Games and Economic Behavior ( 2021 ). Moshe Babaioff, Yannai A Gonczarowski, and Noam Nisan. 2021. The menu-size complexity of revenue approximation. Games and Economic Behavior (2021)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3398745"},{"key":"e_1_3_2_1_7_1","volume-title":"ACM Conference on Economics and Computation (ACM-EC).","author":"Babaioff Moshe","year":"2018","unstructured":"Moshe Babaioff , Noam Nisan , and Aviad Rubinstein . 2018 . Optimal Deterministic Mechanisms for an Additive Buyer . In ACM Conference on Economics and Computation (ACM-EC). Moshe Babaioff, Noam Nisan, and Aviad Rubinstein. 2018. Optimal Deterministic Mechanisms for an Additive Buyer. In ACM Conference on Economics and Computation (ACM-EC)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229025"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/050641181"},{"key":"e_1_3_2_1_10_1","volume-title":"COLT","volume":"2009","author":"Bshouty Nader H","year":"2009","unstructured":"Nader H Bshouty . 2009 . Optimal Algorithms for the Coin Weighing Problem with a Spring Scale . In COLT , Vol. 2009 . 82. Nader H Bshouty. 2009. Optimal Algorithms for the Coin Weighing Problem with a Spring Scale. In COLT, Vol. 2009. 82."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/362588.362602"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399453"},{"key":"e_1_3_2_1_16_1","volume-title":"Bundle-size pricing as an approximation to mixed bundling. The American Economic Review","author":"Chu Chenghuan Sean","year":"2011","unstructured":"Chenghuan Sean Chu , Phillip Leslie , and Alan Sorensen . 2011. Bundle-size pricing as an approximation to mixed bundling. The American Economic Review ( 2011 ), 263--303. Chenghuan Sean Chu, Phillip Leslie, and Alan Sorensen. 2011. Bundle-size pricing as an approximation to mixed bundling. The American Economic Review (2011), 263--303."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0014-2921(97)00122-0"},{"key":"e_1_3_2_1_18_1","series-title":"Colloquia Mathematica Societatis Janos Bolyai 16","volume-title":"Topics in Information Theory","author":"Djackov AG","unstructured":"AG Djackov . 1975. On a search model of false coins . In Topics in Information Theory ( Colloquia Mathematica Societatis Janos Bolyai 16 ). Budapest, Hungary : Hungarian Acad. Sci . 163--170. AG Djackov. 1975. On a search model of false coins. In Topics in Information Theory (Colloquia Mathematica Societatis Janos Bolyai 16). Budapest, Hungary: Hungarian Acad. Sci. 163--170."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132607"},{"volume-title":"Combinatorial group testing and its applications","author":"Du Dingzhu","key":"e_1_3_2_1_20_1","unstructured":"Dingzhu Du , Frank K Hwang , and Frank Hwang . 2000. Combinatorial group testing and its applications . Vol. 12 . World Scientific . Dingzhu Du, Frank K Hwang, and Frank Hwang. 2000. Combinatorial group testing and its applications. Vol. 12. World Scientific."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13129-0_22"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993632"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2039"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.09.008"},{"key":"e_1_3_2_1_25_1","volume-title":"2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)","author":"Feige Uriel","year":"2006","unstructured":"Uriel Feige and Jan Vondrak . 2006 . Approximation algorithms for allocation problems: Improving the factor of 1-1\/e . In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) . IEEE, 667--676. Uriel Feige and Jan Vondrak. 2006. Approximation algorithms for allocation problems: Improving the factor of 1-1\/e. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE, 667--676."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2010.v006a011"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123--135","author":"Feldman Michal","year":"2014","unstructured":"Michal Feldman , Nick Gravin , and Brendan Lucier . 2014 . Combinatorial auctions via posted prices . In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123--135 . Michal Feldman, Nick Gravin, and Brendan Lucier. 2014. Combinatorial auctions via posted prices. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 123--135."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188786"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2580"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the 10th ACM conference on Electronic commerce. 225--234","author":"Hartline Jason D","year":"2009","unstructured":"Jason D Hartline and Tim Roughgarden . 2009 . Simple versus optimal mechanisms . In Proceedings of the 10th ACM conference on Electronic commerce. 225--234 . Jason D Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In Proceedings of the 10th ACM conference on Electronic commerce. 225--234."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366647","article-title":"Algorithm 65","volume":"4","author":"Hoare C. A. R.","year":"1961","unstructured":"C. A. R. Hoare . 1961 . Algorithm 65 : Find. Commun. ACM 4 , 7 (1961), 321 -- 322 . C. A. R. Hoare. 1961. Algorithm 65: Find. Commun. ACM 4, 7 (1961), 321--322.","journal-title":"Find. Commun. ACM"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90063-6"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00023"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_36_1","volume-title":"Determining subsets by unramified experiments. A Survey of Statistical Design and Linear Models","author":"Lindstrom Bernt","year":"1975","unstructured":"Bernt Lindstrom . 1975. Determining subsets by unramified experiments. A Survey of Statistical Design and Linear Models ( 1975 ). Bernt Lindstrom. 1975. Determining subsets by unramified experiments. A Survey of Statistical Design and Linear Models (1975)."},{"volume-title":"Understanding and using linear programming","author":"Matousek Jiri","key":"e_1_3_2_1_37_1","unstructured":"Jiri Matousek and Bernd G\u00e4rtner . 2007. Understanding and using linear programming . Springer Science & Business Media . Jiri Matousek and Bernd G\u00e4rtner. 2007. Understanding and using linear programming. Springer Science & Business Media."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.09.004"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1086\/250032","article-title":"Goethe's second-price auction","volume":"106","author":"Moldovanu Benny","year":"1998","unstructured":"Benny Moldovanu and Manfred Tietzel . 1998 . Goethe's second-price auction . Journal of Political Economy 106 , 4 (1998), 854 -- 859 . Benny Moldovanu and Manfred Tietzel. 1998. Goethe's second-price auction. Journal of Political Economy 106, 4 (1998), 854--859.","journal-title":"Journal of Political Economy"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/261387.261395"},{"key":"e_1_3_2_1_41_1","volume-title":"An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser , Laurence A Wolsey , and Marshall L Fisher . 1978. An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1 ( 1978 ), 265--294. George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1 (1978), 265--294."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Razborov Alexander A","key":"e_1_3_2_1_43_1","unstructured":"Alexander A Razborov . 1990. On the distributional complexity of disjointness . In International Colloquium on Automata, Languages, and Programming . Springer , 249--253. Alexander A Razborov. 1990. On the distributional complexity of disjointness. In International Colloquium on Automata, Languages, and Programming. Springer, 249--253."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501160"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105448"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451111"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175437"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482540.2482612"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597695","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:43Z","timestamp":1750178263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":49,"alternative-id":["10.1145\/3580507.3597695","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597695","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}