{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:41:20Z","timestamp":1755823280580,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Science and Technology Innovation 2030 ?New Generation of Artificial Intelligence? Major Project No.(2018AAA0100903), Innovation Program of Shanghai Municipal Education Commission, Program for Innovative Research Team of Shanghai University of Finance and Economics (IRTSHUFE) and the Fundamental Research Funds for the Central Universities","award":["2018AAA0100903"],"award-info":[{"award-number":["2018AAA0100903"]}]},{"name":"National Key R&D Program of China","award":["2023YFA1009500"],"award-info":[{"award-number":["2023YFA1009500"]}]},{"name":"NSFC","award":["62150610500, 61922052, and 61932002"],"award-info":[{"award-number":["62150610500, 61922052, and 61932002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645418","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"89-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3845-947X","authenticated-orcid":false,"given":"Nikolai","family":"Gravin","sequence":"first","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9360-753X","authenticated-orcid":false,"given":"Yixuan Even","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-0626","authenticated-orcid":false,"given":"Renfei","family":"Zhou","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"MOSEK ApS. 2022. The MOSEK optimization toolbox for MATLAB manual. Version 10.0. MOSEK. http:\/\/docs.mosek.com\/10.0\/toolbox\/index.html"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132522"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch147"},{"volume-title":"A Utility Equivalence Theorem for Concave Functions","author":"Bhalgat Anand","key":"e_1_3_2_2_4_1","unstructured":"Anand Bhalgat and Sanjeev Khanna. 2014. A Utility Equivalence Theorem for Concave Functions. In Integer Programming and Combinatorial Optimization, Jon Lee and Jens Vygen (Eds.). Springer International Publishing, Cham, 126--137."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_2_6_1","volume-title":"Advances in Neural Information Processing Systems, , Daniel D","author":"Chen Wei","year":"2016","unstructured":"Wei Chen, Wei Hu, Fu Li, Jian Li, Yu Liu, and Pinyan Lu. 2016. Combinatorial Multi-Armed Bandit with General Reward Functions. In Advances in Neural Information Processing Systems, , Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Roman Garnett (Eds.), Vol. 29. Curran Associates Inc., Red Hook, NY, USA, 1651--1659. https:\/\/proceedings.neurips.cc\/paper\/2016\/hash\/aa169b49b583a2b5af89203c2b78c67c-Abstract.html"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868250"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583478"},{"key":"e_1_3_2_2_10_1","unstructured":"Gurobi Optimization LLC. 2023. Gurobi Optimizer Reference Manual."},{"key":"e_1_3_2_2_11_1","unstructured":"Jason Hartline. [n. d.]. Mechanism Design and Approximation. http:\/\/jasonhartline.com\/MDnA\/. Accessed: 2022-01--10."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599877"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274644"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0927"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488731"},{"key":"e_1_3_2_2_16_1","first-page":"15800","article-title":"Hitting the high notes: Subset selection for maximizing expected order statistics","volume":"33","author":"Mehta Aranyak","year":"2020","unstructured":"Aranyak Mehta, Uri Nadav, Alexandros Psomas, and Aviad Rubinstein. 2020. Hitting the high notes: Subset selection for maximizing expected order statistics. Advances in Neural Information Processing Systems , Vol. 33 (2020), 15800--15810.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1201\/b11537"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-PS318"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3020652.3020725"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1874-8651(08)60072-1"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467614"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(92)90100-V"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijindorg.2006.10.002"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.104.5.442"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2015.12.016"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Singapore Singapore","acronym":"WWW '24"},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645418","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:25:36Z","timestamp":1755822336000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":25,"alternative-id":["10.1145\/3589334.3645418","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645418","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}