{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:17:50Z","timestamp":1757589470933,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172384, U20A20182, U22B2060"],"award-info":[{"award-number":["62172384, U20A20182, U22B2060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583477","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"page":"3530-3540","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Randomized Pricing with Deferred Acceptance for Revenue Maximization with Submodular Objectives"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2768-6607","authenticated-orcid":false,"given":"He","family":"Huang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6302-5366","authenticated-orcid":false,"given":"Kai","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6080-4850","authenticated-orcid":false,"given":"Shuang","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0785-707X","authenticated-orcid":false,"given":"Jing","family":"Tang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), The Hong Kong University of Science and Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_29"},{"key":"e_1_3_2_1_2_1","volume-title":"On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. In International Conference on Web and Internet Economics (WINE). 1\u201315","author":"Amanatidis Georgios","year":"2017","unstructured":"Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. 2017. On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. In International Conference on Web and Internet Economics (WINE). 1\u201315."},{"key":"e_1_3_2_1_3_1","unstructured":"Georgios Amanatidis Federico Fusco Philip Lazos Stefano Leonardi and Rebecca Reiffenh\u00e4user. 2020. Fast adaptive non-monotone submodular maximization subject to a knapsack constraint. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329622"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1208"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.36"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137635"},{"key":"e_1_3_2_1_8_1","unstructured":"Ashwinkumar Badanidiyuru Amin Karbasi Ehsan Kazemi and Jan Vondr\u00e1k. 2020. Submodular maximization through barrier functions. In Advances in Neural Information Processing Systems (NeurIPS) Vol.\u00a033. 524\u2013534."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"e_1_3_2_1_10_1","unstructured":"Eric Balkanski Adam Breuer and Yaron Singer. 2018. Non-monotone submodular maximization in exponentially fewer iterations. In Advances in Neural Information Processing Systems (NeurIPS). 2359\u20132370."},{"key":"e_1_3_2_1_11_1","volume-title":"Deterministic Budget-Feasible Clock Auctions. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 2940\u20132963","author":"Balkanski Eric","year":"2022","unstructured":"Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, and Xizhi Tan. 2022. Deterministic Budget-Feasible Clock Auctions. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 2940\u20132963."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883032"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214020"},{"key":"e_1_3_2_1_15_1","volume-title":"Submodular Maximization with Cardinality Constraints. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 1433\u20131452","author":"Buchbinder Niv","year":"2014","unstructured":"Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. 2014. Submodular Maximization with Cardinality Constraints. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 1433\u20131452."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.54"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3052963"},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Machine Learning (ICML). 2222\u20132232","author":"Cui Shuang","year":"2021","unstructured":"Shuang Cui, Kai Han, Tianshuai Zhu, Jing Tang, Benwei Wu, and He Huang. 2021. Randomized Algorithms for Submodular Function Maximization with a k -System Constraint. In International Conference on Machine Learning (ICML). 2222\u20132232."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993615"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"A nearly-linear time algorithm for submodular maximization with a knapsack constraint","volume":"53","author":"Ene Alina","year":"2019","unstructured":"Alina Ene and Huy\u00a0L. Nguyen. 2019. A nearly-linear time algorithm for submodular maximization with a knapsack constraint. In International Colloquium on Automata, Languages and Programming (ICALP). 53:1\u201353:12.","journal-title":"International Colloquium on Automata, Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Machine Learning (ICML). 1833\u20131842","author":"Fahrbach Matthew","year":"2019","unstructured":"Matthew Fahrbach, Vahab Mirrokni, and Morteza Zadimoghaddam. 2019. Non-monotone submodular maximization with nearly optimal adaptivity and query complexity. In International Conference on Machine Learning (ICML). 1833\u20131842."},{"key":"e_1_3_2_1_23_1","volume-title":"Conference on Learning Theory (COLT). 758\u2013784","author":"Feldman Moran","year":"2017","unstructured":"Moran Feldman, Christopher Harshaw, and Amin Karbasi. 2017. Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization. In Conference on Learning Theory (COLT). 758\u2013784."},{"key":"e_1_3_2_1_24_1","volume-title":"How Do You Want Your Greedy: Simultaneous or Repeated?preprint, arXiv:2009.13998","author":"Feldman Moran","year":"2020","unstructured":"Moran Feldman, Christopher Harshaw, and Amin Karbasi. 2020. How Do You Want Your Greedy: Simultaneous or Repeated?preprint, arXiv:2009.13998 (2020)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v2i1.13158"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3417746"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"e_1_3_2_1_28_1","volume-title":"International Conference on Machine Learning (ICML).","author":"Haba Ran","year":"2020","unstructured":"Ran Haba, Ehsan Kazemi, Moran Feldman, and Amin Karbasi. 2020. Streaming Submodular Maximization under a k -Set System Constraint. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447383"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367524"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434421"},{"key":"e_1_3_2_1_32_1","volume-title":"Citeseer","author":"Krizhevsky Alex","year":"2009","unstructured":"Alex Krizhevsky, Geoffrey Hinton, 2009. Learning multiple layers of features from tiny images. Technical report, Citeseer (2009)."},{"key":"e_1_3_2_1_33_1","unstructured":"Alan Kuhnle. 2019. Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time. In Advances in Neural Information Processing Systems (NeurIPS). 2371\u20132381."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0592"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00781-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326285.3329043"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16698"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1086\/704074"},{"volume-title":"Optimization techniques","author":"Minoux Michel","key":"e_1_3_2_1_39_1","unstructured":"Michel Minoux. 1978. Accelerated greedy algorithms for maximizing submodular set functions. In Optimization techniques. Springer, 234\u2013243."},{"key":"e_1_3_2_1_40_1","volume-title":"International Conference on Machine Learning (ICML). 1358\u20131367","author":"Mirzasoleiman Baharan","year":"2016","unstructured":"Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, and Amin Karbasi. 2016. Fast constrained submodular maximization: Personalized data summarization. In International Conference on Machine Learning (ICML). 1358\u20131367."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124381"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2692359.2692366"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488489"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v1i1.13068"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583477","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:53Z","timestamp":1750178873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":45,"alternative-id":["10.1145\/3543507.3583477","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583477","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}