{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:30Z","timestamp":1750309350258,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673487","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"263-277","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Setting Targets is All You Need: Improved Order Competitive Ratio for Online Selection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7755-4652","authenticated-orcid":false,"given":"Liyan","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9908-0249","authenticated-orcid":false,"given":"Nuozhou","family":"Sun","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5094-1971","authenticated-orcid":false,"given":"Zhihao Gavin","family":"Tang","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mark Braverman Mahsa Derakhshan and Antonio Molina Lovett. 2022. Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. In EC. ACM 967--985.","DOI":"10.1145\/3490486.3538315"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Shuchi Chawla Jason D. Hartline David L. Malec and Balasubramanian Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In STOC. ACM 311--320.","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.11.010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Paul D\u00fctting Evangelia Gergatsouli Rojin Rezvan Yifeng Teng and Alexandros Tsigonias-Dimitriadis. 2023. Prophet Secretary Against the Online Optimal. In EC. ACM 561--581.","DOI":"10.1145\/3580507.3597736"},{"volume-title":"SODA","author":"Ezra Tomer","key":"e_1_3_2_1_5_1","unstructured":"Tomer Ezra, Michal Feldman, Nick Gravin, and Zhihao Gavin Tang. 2023. \"Who is Next in Line?\" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. In SODA. SIAM, 3759--3776."},{"key":"e_1_3_2_1_6_1","volume-title":"WINE (Lecture Notes in Computer Science","volume":"271","author":"Ezra Tomer","year":"2023","unstructured":"Tomer Ezra and Tamar Garbuz. 2023. The Importance of Knowing the Arrival Order in Combinatorial Bayesian Settings. In WINE (Lecture Notes in Computer Science, Vol. 14413). Springer, 256--271."},{"volume-title":"Automated Online Mechanism Design and Prophet Inequalities","author":"Hajiaghayi Mohammad Taghi","key":"e_1_3_2_1_7_1","unstructured":"Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and Tuomas Sandholm. 2007. Automated Online Mechanism Design and Prophet Inequalities. In AAAI. AAAI Press, 58--65."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_9_1","volume-title":"On semiamarts, amarts, and processes with finite value. Probability on Banach spaces 4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces 4 (1978), 197--266."},{"key":"e_1_3_2_1_10_1","volume-title":"Online Dependent Rounding Schemes. CoRR abs\/2301.08680","author":"Naor Joseph","year":"2023","unstructured":"Joseph Naor, Aravind Srinivasan, and David Wajc. 2023. Online Dependent Rounding Schemes. CoRR abs\/2301.08680 (2023)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Christos H. Papadimitriou Tristan Pollner Amin Saberi and David Wajc. 2021. Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. In EC. ACM 763--764.","DOI":"10.1145\/3465456.3467613"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Tim Roughgarden (Ed.). 2020. Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press.","DOI":"10.1017\/9781108637435"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. In ICALP (LIPIcs, Vol. 198)","volume":"109","author":"Saberi Amin","year":"2021","unstructured":"Amin Saberi and David Wajc. 2021. The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. In ICALP (LIPIcs, Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 109:1--109:18.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_14_1","volume-title":"Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability","author":"Samuel-Cahn Ester","year":"1984","unstructured":"Ester Samuel-Cahn. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability (1984), 1213--1216."}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"New Haven CT USA","acronym":"EC '24"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673487","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:42Z","timestamp":1750291542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":14,"alternative-id":["10.1145\/3670865.3673487","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673487","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}