{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:41:58Z","timestamp":1787017318039,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"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, CCF-1901292, DMS-2022448, DMS-2134108"],"award-info":[{"award-number":["CCF-1942583, CCF-1901292, DMS-2022448, DMS-2134108"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Simons Investigator, Simons Collaboration on the Theory of Algorithmic Fairness"],"award-info":[{"award-number":["Simons Investigator, Simons Collaboration on the Theory of Algorithmic Fairness"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001444","name":"Defence Science and Technology Agency - Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001444","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["Research Fellowship"],"award-info":[{"award-number":["Research Fellowship"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC05-76RL01830"],"award-info":[{"award-number":["DE-AC05-76RL01830"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538354","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T09:29:36Z","timestamp":1657704576000},"page":"897-914","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Recommender Systems meet Mechanism Design"],"prefix":"10.1145","author":[{"given":"Yang","family":"Cai","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Constantinos","family":"Daskalakis","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.90"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229017"},{"key":"e_1_3_2_1_3_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_4_1","volume-title":"the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Babaioff Moshe","unstructured":"Moshe Babaioff , Nicole Immorlica , Brendan Lucier , and S. Matthew Weinberg . 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer . In the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS). Moshe Babaioff, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg. 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer. In the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2011.10.018"},{"key":"e_1_3_2_1_6_1","volume-title":"Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. CoRR","author":"Brustle Johannes","year":"2019","unstructured":"Johannes Brustle , Yang Cai , and Constantinos Daskalakis . 2019. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. CoRR , Vol. abs\/ 1911 .02146 ( 2019 ). arxiv: 1911.02146 http:\/\/arxiv.org\/abs\/1911.02146 Johannes Brustle, Yang Cai, and Constantinos Daskalakis. 2019. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. CoRR, Vol. abs\/1911.02146 (2019). arxiv: 1911.02146 http:\/\/arxiv.org\/abs\/1911.02146"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Johannes Brustle Yang Cai and Constantinos Daskalakis. 2020. Multi-item mechanisms without item-independence: Learnability via robustness. In EC.  Johannes Brustle Yang Cai and Constantinos Daskalakis. 2020. Multi-item mechanisms without item-independence: Learnability via robustness. In EC.","DOI":"10.1145\/3391403.3399541"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Yang Cai and Constantinos Daskalakis. 2017. Learning Multi-item Auctions with (or without) Samples. In FOCS.  Yang Cai and Constantinos Daskalakis. 2017. Learning Multi-item Auctions with (or without) Samples. In FOCS.","DOI":"10.1109\/FOCS.2017.54"},{"key":"e_1_3_2_1_9_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_1_10_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_1_11_1","volume-title":"the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Cai Yang","unstructured":"Yang Cai , Constantinos Daskalakis , and S. Matthew Weinberg . 2013a. Reducing Revenue to Welfare Maximization : Approximation Algorithms and other Generalizations . In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2013a. Reducing Revenue to Welfare Maximization : Approximation Algorithms and other Generalizations. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_12_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 . 2013b. 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. 2013b. Understanding Incentives: Mechanism Design becomes Algorithm Design. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Yang Cai Nikhil R. Devanur and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In STOC.  Yang Cai Nikhil R. Devanur and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In STOC.","DOI":"10.1145\/2897518.2897645"},{"key":"e_1_3_2_1_14_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_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_1_16_1","unstructured":"Sourav Chatterjee. 2005. Concentration inequalities with exchangeable pairs. Ph. D. Dissertation. Citeseer.  Sourav Chatterjee. 2005. Concentration inequalities with exchangeable pairs. Ph. D. Dissertation. Citeseer."},{"key":"e_1_3_2_1_17_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_1_18_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 . 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. 2010. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the ACM Conference on Economics and Computation (EC).","author":"Chawla Shuchi","unstructured":"Shuchi Chawla and J. Benjamin Miller . 2016. Mechanism Design for Subadditive Agents via an Ex-Ante Relaxation . In Proceedings of the ACM Conference on Economics and Computation (EC). Shuchi Chawla and J. Benjamin Miller. 2016. Mechanism Design for Subadditive Agents via an Ex-Ante Relaxation. In Proceedings of the ACM Conference on Economics and Computation (EC)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.93"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2845926.2845928"},{"key":"e_1_3_2_1_22_1","volume-title":"ACM Conference on Electronic Commerce, EC '13","author":"Daskalakis Constantinos","year":"2013","unstructured":"Constantinos Daskalakis , Alan Deckelbaum , and Christos Tzamos . 2013 . Mechanism design via optimal transport . 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, 269--286. https:\/\/doi.org\/10.1145\/2482540.2482593 10.1145\/2482540.2482593 Constantinos Daskalakis, Alan Deckelbaum, and Christos Tzamos. 2013. Mechanism design via optimal transport. 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, 269--286. https:\/\/doi.org\/10.1145\/2482540.2482593"},{"key":"e_1_3_2_1_23_1","volume-title":"The Complexity of Optimal Mechanism Design. In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Daskalakis Constantinos","year":"2014","unstructured":"Constantinos Daskalakis , Alan Deckelbaum , and Christos Tzamos . 2014 . The Complexity of Optimal Mechanism Design. In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Constantinos Daskalakis, Alan Deckelbaum, and Christos Tzamos. 2014. The Complexity of Optimal Mechanism Design. In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Constantinos Daskalakis Maxwell Fishelson Brendan Lucier Vasilis Syrgkanis and Santhoshini Velusamy. 2020. Simple Credible and Approximately-Optimal Auctions. In EC.  Constantinos Daskalakis Maxwell Fishelson Brendan Lucier Vasilis Syrgkanis and Santhoshini Velusamy. 2020. Simple Credible and Approximately-Optimal Auctions. In EC.","DOI":"10.1145\/3391403.3399535"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981345.2981486"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Shaddin Dughmi Li Han and Noam Nisan. 2014. Sampling and representation complexity of revenue maximization. In WINE.  Shaddin Dughmi Li Han and Noam Nisan. 2014. Sampling and representation complexity of revenue maximization. In WINE.","DOI":"10.1007\/978-3-319-13129-0_22"},{"key":"e_1_3_2_1_28_1","volume-title":"International Conference on Machine Learning. PMLR, 1706--1715","author":"D\u00fctting Paul","year":"2019","unstructured":"Paul D\u00fctting , Zhe Feng , Harikrishna Narasimhan , David Parkes , and Sai Srivatsa Ravindranath . 2019 . Optimal auctions through deep learning . In International Conference on Machine Learning. PMLR, 1706--1715 . Paul D\u00fctting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. 2019. Optimal auctions through deep learning. In International Conference on Machine Learning. PMLR, 1706--1715."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3237383.3237439"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602883"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_12"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Yannai A Gonczarowski and S Matthew Weinberg. 2018. The Sample Complexity of Up-to-$varepsilon$ Multi-Dimensional Revenue Maximization. In FOCS.  Yannai A Gonczarowski and S Matthew Weinberg. 2018. The Sample Complexity of Up-to-$varepsilon$ Multi-Dimensional Revenue Maximization. In FOCS.","DOI":"10.1109\/FOCS.2018.00047"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Sergiu Hart and Noam Nisan. 2012. Approximate Revenue Maximization with Multiple Items. In EC.  Sergiu Hart and Noam Nisan. 2012. Approximate Revenue Maximization with Multiple Items. In EC.","DOI":"10.1145\/2229012.2229061"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Sergiu Hart Noam Nisan etal 2013. The menu-size complexity of auctions .Center for the Study of Rationality.  Sergiu Hart Noam Nisan et al. 2013. The menu-size complexity of auctions .Center for the Study of Rationality.","DOI":"10.1145\/2482540.2482544"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940746"},{"key":"e_1_3_2_1_36_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_1_37_1","volume-title":"Conference on Learning Theory. PMLR, 1298--1318","author":"Morgenstern Jamie","year":"2016","unstructured":"Jamie Morgenstern and Tim Roughgarden . 2016 . Learning simple auctions . In Conference on Learning Theory. PMLR, 1298--1318 . Jamie Morgenstern and Tim Roughgarden. 2016. Learning simple auctions. In Conference on Learning Theory. PMLR, 1298--1318."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Noam Nisan Tim Roughgarden E. Tardos and V. V. Vazirani (Eds.). 2007. Algorithmic Game Theory. Cambridge University Press.  Noam Nisan Tim Roughgarden E. Tardos and V. V. Vazirani (Eds.). 2007. Algorithmic Game Theory. Cambridge University Press.","DOI":"10.1017\/CBO9780511800481"},{"key":"#cr-split#-e_1_3_2_1_40_1.1","doi-asserted-by":"crossref","unstructured":"Aviad Rubinstein and S. Matthew Weinberg. 2015. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity. In EC. https:\/\/doi.org\/10.1145\/2764468.2764510 10.1145\/2764468.2764510","DOI":"10.1145\/2764468.2764510"},{"key":"#cr-split#-e_1_3_2_1_40_1.2","doi-asserted-by":"crossref","unstructured":"Aviad Rubinstein and S. Matthew Weinberg. 2015. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity. In EC. https:\/\/doi.org\/10.1145\/2764468.2764510","DOI":"10.1145\/2764468.2764510"},{"key":"e_1_3_2_1_41_1","volume-title":"Recent developments in non-asymptotic theory of random matrices. Modern aspects of random matrix theory","author":"Rudelson Mark","year":"2014","unstructured":"Mark Rudelson . 2014. Recent developments in non-asymptotic theory of random matrices. Modern aspects of random matrix theory , Vol. 72 ( 2014 ), 83. Mark Rudelson. 2014. Recent developments in non-asymptotic theory of random matrices. Modern aspects of random matrix theory, Vol. 72 (2014), 83."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/3306127.3331696"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700153"},{"key":"e_1_3_2_1_44_1","unstructured":"Vasilis Syrgkanis. 2017. A Sample Complexity Measure with Applications to Learning Optimal Auctions. In Advances in Neural Information Processing Systems (NeurIPS).  Vasilis Syrgkanis. 2017. A Sample Complexity Measure with Applications to Learning Optimal Auctions. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_45_1","volume-title":"A lower bound for the smallest singular value of a matrix. Linear Algebra and its applications","author":"Varah James M","year":"1975","unstructured":"James M Varah . 1975. A lower bound for the smallest singular value of a matrix. Linear Algebra and its applications , Vol. 11 , 1 ( 1975 ), 3--5. James M Varah. 1975. A lower bound for the smallest singular value of a matrix. Linear Algebra and its applications, Vol. 11, 1 (1975), 3--5."},{"key":"e_1_3_2_1_46_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 '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538354","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538354","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:03:00Z","timestamp":1750172580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":47,"alternative-id":["10.1145\/3490486.3538354","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538354","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}