{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T07:14:11Z","timestamp":1765178051123,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"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":[{"name":"Research Grants Council, University Grants Committee","award":["HKU17203717E"],"award-info":[{"award-number":["HKU17203717E"]}]},{"name":"Research Grants Council of Hong Kong","award":["HKU17203717E"],"award-info":[{"award-number":["HKU17203717E"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467631","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:45Z","timestamp":1626604125000},"page":"610-629","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Targeting Makes Sample Efficiency in Auction Design"],"prefix":"10.1145","author":[{"given":"Yihang","family":"Hu","sequence":"first","affiliation":[{"name":"IIIS, Tsinghua University, Beijing, China"}]},{"given":"Zhiyi","family":"Huang","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, China"}]},{"given":"Yiheng","family":"Shen","sequence":"additional","affiliation":[{"name":"IIIS, Tsinghua University, Beijing, China"}]},{"given":"Xiangning","family":"Wang","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219217"},{"key":"e_1_3_2_1_2_1","first-page":"38","article-title":"On a modification of Chebyshev's inequality and of the error formula of","volume":"1","author":"Bernstein Sergei","year":"1924","unstructured":"Sergei Bernstein . 1924 . On a modification of Chebyshev's inequality and of the error formula of Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math , Vol. 1 , 4 (1924), 38 -- 49 . Sergei Bernstein. 1924. On a modification of Chebyshev's inequality and of the error formula of Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math, Vol. 1, 4 (1924), 38--49.","journal-title":"Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math"},{"key":"e_1_3_2_1_3_1","volume-title":"Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. arXiv preprint arXiv:1911.02146","author":"Brustle Johaness","year":"2019","unstructured":"Johaness Brustle , Yang Cai , and Constantinos Daskalakis . 2019. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. arXiv preprint arXiv:1911.02146 ( 2019 ). Johaness Brustle, Yang Cai, and Constantinos Daskalakis. 2019. Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. arXiv preprint arXiv:1911.02146 (2019)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.54"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/130945508"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/140964199"},{"key":"e_1_3_2_1_7_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Chen Jing","year":"2018","unstructured":"Jing Chen , Bo Li , Yingkai Li , and Pinyan Lu . 2018 . Brief Announcement: Bayesian Auctions with Efficient Queries. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Jing Chen, Bo Li, Yingkai Li, and Pinyan Lu. 2018. Brief Announcement: Bayesian Auctions with Efficient Queries. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897553"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.03.011"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13129-0_22"},{"volume-title":"Proceedings of the 49th Annual ACM Symposium on Theory of Computing. 856--868","author":"Yannai","key":"e_1_3_2_1_12_1","unstructured":"Yannai A. Gonczarowski and Noam Nisan. 2017. Efficient Empirical Revenue Maximization in Single-parameter Auction Environments . In Proceedings of the 49th Annual ACM Symposium on Theory of Computing. 856--868 . Yannai A. Gonczarowski and Noam Nisan. 2017. Efficient Empirical Revenue Maximization in Single-parameter Auction Environments. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing. 856--868."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science. IEEE, 416--426","author":"Gonczarowski Yannai A","year":"2018","unstructured":"Yannai A Gonczarowski and S Matthew Weinberg . 2018 . The Sample Complexity of Up-to-$varepsilon$ Multi-Dimensional Revenue Maximization . In Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science. IEEE, 416--426 . Yannai A Gonczarowski and S Matthew Weinberg. 2018. The Sample Complexity of Up-to-$varepsilon$ Multi-Dimensional Revenue Maximization. In Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science. IEEE, 416--426."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316325"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1065719"},{"key":"e_1_3_2_1_16_1","unstructured":"Jamie H Morgenstern and Tim Roughgarden. 2015. On the pseudo-dimension of nearly optimal auctions. In Advances in Neural Information Processing Systems. 136--144.  Jamie H Morgenstern and Tim Roughgarden. 2015. On the pseudo-dimension of nearly optimal auctions. In Advances in Neural Information Processing Systems. 136--144."},{"key":"e_1_3_2_1_17_1","volume-title":"Optimal auction design. Mathematics of operations research","author":"Myerson Roger B","year":"1981","unstructured":"Roger B Myerson . 1981. Optimal auction design. Mathematics of operations research , Vol. 6 , 1 ( 1981 ), 58--73. Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research, Vol. 6, 1 (1981), 58--73."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993585"},{"key":"e_1_3_2_1_19_1","unstructured":"Vasilis Syrgkanis. 2017. A sample complexity measure with applications to learning optimal auctions. In Advances in Neural Information Processing Systems. 5352--5359.  Vasilis Syrgkanis. 2017. A sample complexity measure with applications to learning optimal auctions. In Advances in Neural Information Processing Systems. 5352--5359."},{"key":"e_1_3_2_1_20_1","volume-title":"18th Annual Symposium on Foundations of Computer Science (sfcs","author":"Chi-Chin Yao Andrew","year":"1977","unstructured":"Andrew Chi-Chin Yao . 1977 . Probabilistic computations: Toward a unified measure of complexity . In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE, 222--227. Andrew Chi-Chin Yao. 1977. Probabilistic computations: Toward a unified measure of complexity. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE, 222--227."}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Budapest Hungary","acronym":"EC '21"},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467631","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467631","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.3467631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":20,"alternative-id":["10.1145\/3465456.3467631","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467631","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"}}]}}