{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:59:08Z","timestamp":1787385548500,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1942583 (CAREER)"],"award-info":[{"award-number":["CCF-1942583 (CAREER)"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["2019 Research Fellowship"],"award-info":[{"award-number":["2019 Research Fellowship"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467643","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"242-262","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["On Simple Mechanisms for Dependent Items"],"prefix":"10.1145","author":[{"given":"Yang","family":"Cai","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Argyris","family":"Oikonomou","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.90"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229017"},{"key":"e_1_3_2_2_3_1","volume-title":"The Simple Economics of Approximately Optimal Auctions. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013","author":"Alaei Saeed","year":"2013","unstructured":"Saeed Alaei , Hu Fu , Nima Haghpanah , and Jason D. Hartline . 2013 . The Simple Economics of Approximately Optimal Auctions. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 , 26--29 October , 2013 , Berkeley, CA, USA. IEEE Computer Society, 628--637. https:\/\/doi.org\/10.1109\/FOCS. 2013.73 Saeed Alaei, Hu Fu, Nima Haghpanah, and Jason D. Hartline. 2013. The Simple Economics of Approximately Optimal Auctions. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26--29 October, 2013, Berkeley, CA, USA. IEEE Computer Society, 628--637. https:\/\/doi.org\/10.1109\/FOCS.2013.73"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_9"},{"key":"e_1_3_2_2_6_1","volume-title":"ACM Conference on Electronic Commerce, EC '13","author":"Bhalgat Anand","year":"2013","unstructured":"Anand Bhalgat , Sreenivas Gollapudi , and Kamesh Munagala . 2013 . Optimal auctions via the multiplicative weight method . In ACM Conference on Electronic Commerce, EC '13 , Philadelphia, PA, USA, June 16--20 , 2013, Michael J. Kearns, R. Preston McAfee, and \u00c9 va Tardos (Eds.). ACM, 73--90. https:\/\/doi.org\/10.1145\/2482540.2482547 Anand Bhalgat, Sreenivas Gollapudi, and Kamesh Munagala. 2013. Optimal auctions via the multiplicative weight method. In ACM Conference on Electronic Commerce, EC '13, Philadelphia, PA, USA, June 16--20, 2013, Michael J. Kearns, R. Preston McAfee, and \u00c9 va Tardos (Eds.). ACM, 73--90. https:\/\/doi.org\/10.1145\/2482540.2482547"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/346773.346785"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.011"},{"key":"e_1_3_2_2_9_1","volume-title":"Multi-Item Mechanisms without Item-Independence: Learnability via Robustness (EC '20)","author":"Brustle Johannes","unstructured":"Johannes Brustle , Yang Cai , and Constantinos Daskalakis . 2020. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness (EC '20) . Association for Computing Machinery , New York, NY, USA , 715--761. https:\/\/doi.org\/10.1145\/3391403.3399541 Johannes Brustle, Yang Cai, and Constantinos Daskalakis. 2020. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness (EC '20). Association for Computing Machinery, New York, NY, USA, 715--761. https:\/\/doi.org\/10.1145\/3391403.3399541"},{"key":"e_1_3_2_2_10_1","volume-title":"Extreme-Value Theorems for Optimal Multidimensional Pricing. In the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Cai Yang","year":"2011","unstructured":"Yang Cai and Constantinos Daskalakis . 2011 . Extreme-Value Theorems for Optimal Multidimensional Pricing. In the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS). Yang Cai and Constantinos Daskalakis. 2011. Extreme-Value Theorems for Optimal Multidimensional Pricing. In the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_11_1","volume-title":"An Algorithmic Characterization of Multi-Dimensional Mechanisms. In the 44th Annual ACM Symposium on Theory of Computing (STOC).","author":"Cai Yang","unstructured":"Yang Cai , Constantinos Daskalakis , and S. Matthew Weinberg . 2012a . An Algorithmic Characterization of Multi-Dimensional Mechanisms. In the 44th Annual ACM Symposium on Theory of Computing (STOC). Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2012a. An Algorithmic Characterization of Multi-Dimensional Mechanisms. In the 44th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_2_12_1","volume-title":"the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Cai Yang","unstructured":"Yang Cai , Constantinos Daskalakis , and S. Matthew Weinberg . 2012b. Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization . In the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS). Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2012b. Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization. In the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_13_1","volume-title":"the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Cai Yang","unstructured":"Yang Cai , Constantinos Daskalakis , and S. Matthew Weinberg . 2013. Understanding Incentives: Mechanism Design becomes Algorithm Design . In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS). Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2013. Understanding Incentives: Mechanism Design becomes Algorithm Design. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_14_1","volume-title":"the 48th Annual ACM Symposium on Theory of Computing (STOC).","author":"Cai Yang","unstructured":"Yang Cai , Nikhil R. Devanur , and S. Matthew Weinberg . 2016. A Duality Based Unified Approach to Bayesian Mechanism Design . In the 48th Annual ACM Symposium on Theory of Computing (STOC). Yang Cai, Nikhil R. Devanur, and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In the 48th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_2_15_1","volume-title":"Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Cai Yang","year":"2013","unstructured":"Yang Cai and Zhiyi Huang . 2013 . Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Yang Cai and Zhiyi Huang. 2013. Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_2_16_1","volume-title":"Simple Mechanisms for Subadditive Buyers via Duality. CoRR","author":"Cai Yang","year":"2016","unstructured":"Yang Cai and Mingfei Zhao . 2016. Simple Mechanisms for Subadditive Buyers via Duality. CoRR , Vol. abs\/ 1611 .06910 ( 2016 ). arxiv: 1611.06910 http:\/\/arxiv.org\/abs\/1611.06910 Yang Cai and Mingfei Zhao. 2016. Simple Mechanisms for Subadditive Buyers via Duality. CoRR, Vol. abs\/1611.06910 (2016). arxiv: 1611.06910 http:\/\/arxiv.org\/abs\/1611.06910"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_2_18_1","volume-title":"the 8th ACM Conference on Electronic Commerce (EC).","author":"Chawla Shuchi","unstructured":"Shuchi Chawla , Jason D. Hartline , and Robert D. Kleinberg . 2007. Algorithmic Pricing via Virtual Valuations . In the 8th ACM Conference on Electronic Commerce (EC). Shuchi Chawla, Jason D. Hartline, and Robert D. Kleinberg. 2007. Algorithmic Pricing via Virtual Valuations. In the 8th ACM Conference on Electronic Commerce (EC)."},{"key":"e_1_3_2_2_19_1","volume-title":"Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC).","author":"Chawla Shuchi","year":"2010","unstructured":"Shuchi Chawla , Jason D. Hartline , David L. Malec , and Balasubramanian Sivan . 2010 a. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC). Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010a. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807366"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_2_22_1","volume-title":"Conference on Learning Theory, COLT 2019","volume":"99","author":"Dagan Yuval","year":"2019","unstructured":"Yuval Dagan , Constantinos Daskalakis , Nishanth Dikkala , and Siddhartha Jayanti . 2019 a. Learning from Weakly Dependent Data under Dobrushin's Condition . In Conference on Learning Theory, COLT 2019 , 25--28 June 2019, Phoenix, AZ, USA (Proceedings of Machine Learning Research), Alina Beygelzimer and Daniel Hsu (Eds.) , Vol. 99 . PMLR, 914--928. http:\/\/proceedings.mlr.press\/v99\/dagan19a.html Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti. 2019 a. Learning from Weakly Dependent Data under Dobrushin's Condition. In Conference on Learning Theory, COLT 2019, 25--28 June 2019, Phoenix, AZ, USA (Proceedings of Machine Learning Research), Alina Beygelzimer and Daniel Hsu (Eds.), Vol. 99. PMLR, 914--928. http:\/\/proceedings.mlr.press\/v99\/dagan19a.html"},{"key":"e_1_3_2_2_23_1","volume-title":"2019 b. Learning from weakly dependent data under Dobrushin's condition. CoRR","author":"Dagan Yuval","year":"2019","unstructured":"Yuval Dagan , Constantinos Daskalakis , Nishanth Dikkala , and Siddhartha Jayanti . 2019 b. Learning from weakly dependent data under Dobrushin's condition. CoRR , Vol. abs\/ 1906 .09247 ( 2019 ). arxiv: 1906.09247 http:\/\/arxiv.org\/abs\/1906.09247 Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti. 2019 b. Learning from weakly dependent data under Dobrushin's condition. CoRR, Vol. abs\/1906.09247 (2019). arxiv: 1906.09247 http:\/\/arxiv.org\/abs\/1906.09247"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764521"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175435"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2932255"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1113026"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01011153"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-ECP173"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_2_31_1","volume-title":"Prophet Inequalities with Linear Correlations and Augmentations. In EC '20: The 21st ACM Conference on Economics and Computation","author":"Immorlica Nicole","year":"2020","unstructured":"Nicole Immorlica , Sahil Singla , and Bo Waggoner . 2020 . Prophet Inequalities with Linear Correlations and Augmentations. In EC '20: The 21st ACM Conference on Economics and Computation , Virtual Event, Hungary, July 13--17 , 2020, P\u00e9 ter Bir\u00f3, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 159--185. https:\/\/doi.org\/10.1145\/3391403.3399452 Nicole Immorlica, Sahil Singla, and Bo Waggoner. 2020. Prophet Inequalities with Linear Correlations and Augmentations. In EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13--17, 2020, P\u00e9 ter Bir\u00f3, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 159--185. https:\/\/doi.org\/10.1145\/3391403.3399452"},{"key":"e_1_3_2_2_32_1","volume-title":"Markov random fields and their applications","author":"Kindermann Ross","unstructured":"Ross Kindermann and Laurie Snell . 1980. Markov random fields and their applications . Vol. 1 . American Mathematical Society . https:\/\/doi.org\/10.1090\/conm\/001 Ross Kindermann and Laurie Snell. 1980. Markov random fields and their applications. Vol. 1. American Mathematical Society. https:\/\/doi.org\/10.1090\/conm\/001"},{"key":"e_1_3_2_2_33_1","volume-title":"Matroid Prophet Inequalities. In the 44th Annual ACM Symposium on Theory of Computing (STOC).","author":"Kleinberg Robert","unstructured":"Robert Kleinberg and S. Matthew Weinberg . 2012 . Matroid Prophet Inequalities. In the 44th Annual ACM Symposium on Theory of Computing (STOC). Robert Kleinberg and S. Matthew Weinberg. 2012. Matroid Prophet Inequalities. In the 44th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_2_34_1","volume-title":"On semiamarts, amarts, and processes with finite value. Probability on Banach spaces","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston . 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces , Vol. 4 ( 1978 ), 197--266. Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, Vol. 4 (1978), 197--266."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Steffen L. Lauritzen. 1996. Graphical Models .Oxford University Press. Steffen L. Lauritzen. 1996. Graphical Models .Oxford University Press.","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"e_1_3_2_2_36_1","volume-title":"Wilmer","author":"Levin David A.","year":"2009","unstructured":"David A. Levin , Yuval Peres , and Elizabeth L . Wilmer . 2009 . Markov chains and mixing times. American Mathematical Soc., Providence ( 2009). David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. 2009. Markov chains and mixing times. American Mathematical Soc., Providence (2009)."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329563"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109653"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501160"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764510"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Ester Samuel-Cahn etal 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability Vol. 12 4 (1984) 1213--1216. Ester Samuel-Cahn et al. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability Vol. 12 4 (1984) 1213--1216.","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096629"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1214\/009117906000000368"},{"key":"e_1_3_2_2_45_1","volume-title":"SODA. CoRR","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 SODA. CoRR ( 2015 ). http:\/\/arxiv.org\/abs\/1406.3278 Andrew Chi-Chih Yao. 2015. An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications, In SODA. CoRR (2015). http:\/\/arxiv.org\/abs\/1406.3278"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467643","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467643","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":45,"alternative-id":["10.1145\/3465456.3467643","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467643","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}