{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:55Z","timestamp":1775815495194,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","funder":[{"name":"Investissements d'Avenir","award":["PSL JRC 2024 - N 2024-488"],"award-info":[{"award-number":["PSL JRC 2024 - N 2024-488"]}]},{"name":"National Recovery and Resilience Plan Greece 2.0","award":["MIS 5154714"],"award-info":[{"award-number":["MIS 5154714"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742668","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:05Z","timestamp":1751482085000},"page":"1046-1075","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-6304-2695","authenticated-orcid":false,"given":"Andreas","family":"Charalampopoulos","sequence":"first","affiliation":[{"name":"National Technical University of Athens and Archimedes, Athena Research Center, Greece, Athens, Attica, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6864-8960","authenticated-orcid":false,"given":"Dimitris","family":"Fotakis","sequence":"additional","affiliation":[{"name":"National Technical University of Athens and Archimedes, Athena Research Center, Greece, Athens, Attica, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9540-2334","authenticated-orcid":false,"given":"Panagiotis","family":"Patsilinakos","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Dauphine-PSL, CNRS, LAMSADE, 75016, Paris, France, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8354-8855","authenticated-orcid":false,"given":"Thanos","family":"Tolias","sequence":"additional","affiliation":[{"name":"National Technical University of Athens and Archimedes, Athena Research Center, Greece, Athens, Attica, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of the 13th Conference on Web and Internet Economics (WINE 2017)","volume":"15","author":"Amanatidis Georgios","year":"2017","unstructured":"Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. 2017. On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. In Proc. of the 13th Conference on Web and Internet Economics (WINE 2017) (Lecture Notes in Computer Science, Vol. 10660). Springer, 1\u201315."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1208"},{"key":"e_1_3_2_1_3_1","unstructured":"Georgios Amanatidis Evangelos Markakis Christodoulos Santorinaios Guido Sch\u00e4fer Panagiotis Tsamopoulos and Artem Tsikiridis. 2025. Online Budget-Feasible Mechanism Design with Predictions. arXiv:2505.24624 [cs.GT] https:\/\/arxiv.org\/abs\/2505.24624"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of the 55th IEEE Symposium on Foundations of Computer Science (FOCS","author":"Anari Nima","year":"2014","unstructured":"Nima Anari, Gagan Goel, and Afshin Nikzad. 2014. Mechanism Design for Crowdsourcing: An Optimal 1 - 1\/e Competitive Budget-Feasible Mechanism for Large Markets. In Proc. of the 55th IEEE Symposium on Foundations of Computer Science (FOCS 2014). IEEE Computer Society, 266\u2013275."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of the 60th IEEE Symposium on Foundations of Computer Science (FOCS","author":"Assadi Sepehr","year":"2019","unstructured":"Sepehr Assadi and Sahil Singla. 2019. Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. In Proc. of the 60th IEEE Symposium on Foundations of Computer Science (FOCS 2019). IEEE Computer Society, 233\u2013248."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3440959.3440964"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-00532-x"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of the 13th ACM Conference on Electronic Commerce (EC","author":"Badanidiyuru Ashwinkumar","year":"2012","unstructured":"Ashwinkumar Badanidiyuru, Robert Kleinberg, and Yaron Singer. 2012. Learning on a budget: posted price mechanisms for online procurement. In Proc. of the 13th ACM Conference on Electronic Commerce (EC 2012). ACM, 128\u2013145."},{"key":"e_1_3_2_1_9_1","volume-title":"Proce. of the 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Balkanski Eric","year":"2022","unstructured":"Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, and Xizhi Tan. 2022. Deterministic Budget-Feasible Clock Auctions. In Proce. of the 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022). SIAM, 2940\u20132963."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of the 25th Conference on World Wide Web (WWW","author":"Balkanski Eric","year":"2016","unstructured":"Eric Balkanski and Jason D. Hartline. 2016. Bayesian Budget Feasibility with Posted Pricing. In Proc. of the 25th Conference on World Wide Web (WWW 2016). ACM, 189\u2013203."},{"key":"e_1_3_2_1_11_1","article-title":"Submodular secretary problem and extensions","volume":"9","author":"Bateni MohammadHossein","year":"2013","unstructured":"MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, and Morteza Zadimoghaddam. 2013. Submodular secretary problem and extensions. ACM Transactions on Algorithms 9, 4 (2013), 32:1\u201332:23.","journal-title":"ACM Transactions on Algorithms"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of the 44th Symposium on Theory of Computing Conference (STOC","author":"Bei Xiaohui","year":"2012","unstructured":"Xiaohui Bei, Ning Chen, Nick Gravin, and Pinyan Lu. 2012. Budget feasible mechanism design: from prior-free to bayesian. In Proc. of the 44th Symposium on Theory of Computing Conference (STOC 2012). ACM, 449\u2013458."},{"key":"e_1_3_2_1_13_1","volume-title":"Online computation and competitive analysis","author":"Borodin Allan","unstructured":"Allan Borodin and Ran El-Yaniv. 1998. Online computation and competitive analysis. Cambridge University Press."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of 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 Proc. of the 42nd ACM Symposium on Theory of Computing (STOC 2010). ACM, 311\u2013320."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Chen Ning","year":"2011","unstructured":"Ning Chen, Nick Gravin, and Pinyan Lu. 2011. On the Approximability of Budget Feasible Mechanisms. In Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2011). SIAM, 685\u2013699."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993615"},{"key":"e_1_3_2_1_17_1","first-page":"2","article-title":"Balls and bins: a study in negative dependence","volume":"13","author":"Dubhashi Devdatt","year":"1998","unstructured":"Devdatt Dubhashi and Desh Ranjan. 1998. Balls and bins: a study in negative dependence. Random Structures and Algorithms 13, 2 (Sept. 1998), 99\u2013124.","journal-title":"Random Structures and Algorithms"},{"key":"e_1_3_2_1_18_1","first-page":"239","article-title":"An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions","volume":"53","author":"D\u00fctting Paul","year":"2024","unstructured":"Paul D\u00fctting, Thomas Kesselheim, and Brendan Lucier. 2024. An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. SIAM J. Comput. 53, 6 (2024), 239\u2013275.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_19_1","first-page":"627","article-title":"The optimum choice of the instant for stopping a Markov process","volume":"4","author":"Dynkin Eugene B","year":"1963","unstructured":"Eugene B Dynkin. 1963. The optimum choice of the instant for stopping a Markov process. Soviet Mathematics - Doklady 4 (1963), 627\u2013629.","journal-title":"Soviet Mathematics - Doklady"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of the 14th Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2011) and of the 15th Conference on on Randomization and Computation (RANDOM 2011)","volume":"229","author":"Feldman Moran","year":"2011","unstructured":"Moran Feldman, Joseph Naor, and Roy Schwartz. 2011. Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). In Proc. of the 14th Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2011) and of the 15th Conference on on Randomization and Computation (RANDOM 2011) (Lecture Notes in Computer Science, Vol. 6845). Springer, 218\u2013229."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3417746"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of the 37th Conference on Neural Information Processing Systems (NeurIPS","author":"Han Kai","year":"2023","unstructured":"Kai Han, You Wu, He Huang, and Shuang Cui. 2023. Triple Eagle: Simple, Fast and Practical Budget-Feasible Mechanisms. In Proc. of the 37th Conference on Neural Information Processing Systems (NeurIPS 2023). 18 pages."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583477"},{"key":"e_1_3_2_1_24_1","article-title":"Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations","volume":"9","author":"Jalaly Pooya","year":"2021","unstructured":"Pooya Jalaly and \u00c9va Tardos. 2021. Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. ACM Transactions on Economics and Computation 9, 1 (2021), 4:1\u20134:20.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"e_1_3_2_1_25_1","volume-title":"Johnson and Samuel Kotz","author":"Norman","year":"1977","unstructured":"Norman L. Johnson and Samuel Kotz. 1977. Urn Models and Their Application: An Approach to Modern Discrete Probability Theory. Wiley."},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. of the 20th Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2017) and of the 21st Conference on on Randomization and Computation (RANDOM 2017)","volume":"22","author":"Kesselheim Thomas","year":"2017","unstructured":"Thomas Kesselheim and Andreas T\u00f6nnis. 2017. Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. In Proc. of the 20th Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2017) and of the 21st Conference on on Randomization and Computation (RANDOM 2017) (LIPIcs, Vol. 81). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:22."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Kleinberg Robert D.","year":"2005","unstructured":"Robert D. Kleinberg. 2005. A multiple-choice secretary algorithm with applications to online auctions. In Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). SIAM, 630\u2013631."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","first-page":"3257","DOI":"10.1257\/aer.20160425","article-title":"Obviously Strategy-Proof Mechanisms","volume":"107","author":"Li Shengwu","year":"2017","unstructured":"Shengwu Li. 2017. Obviously Strategy-Proof Mechanisms. The American Economic Review 107, 1 (2017), 3257\u20133287.","journal-title":"The American Economic Review"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of the IEEE Conference on Communications (ICC","author":"Liu Qing","year":"2015","unstructured":"Qing Liu, Tie Luo, Ruiming Tang, and St\u00e9phane Bressan. 2015. An efficient and truthful pricing mechanism for team formation in crowdsourcing markets. In Proc. of the IEEE Conference on Communications (ICC 2015). 567\u2013572."},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. of the 33rd International Joint Conference on Artificial Intelligence (IJCAI","author":"Liu Xiang","year":"2024","unstructured":"Xiang Liu, Hau Chan, Minming Li, and Weiwei Wu. 2024. Budget Feasible Mechanisms: A Survey. In Proc. of the 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024). ijcai.org, 8132\u20138141."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_33_1","article-title":"Incentive Mechanisms for Participatory Sensing: Survey and Research Challenges","volume":"12","author":"Restuccia Francesco","year":"2016","unstructured":"Francesco Restuccia, Sajal K. Das, and Jamie Payton. 2016. Incentive Mechanisms for Participatory Sensing: Survey and Research Challenges. ACM Transactions on Sensor Networks 12, 2, Article 13 (2016), 40 pages.","journal-title":"ACM Transactions on Sensor Networks"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. of the 51th IEEE Symposium on Foundations of Computer Science (FOCS","author":"Singer Yaron","year":"2010","unstructured":"Yaron Singer. 2010. Budget Feasible Mechanisms. In Proc. of the 51th IEEE Symposium on Foundations of Computer Science (FOCS 2010). IEEE Computer Society, 765\u2013774."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/2692359.2692366","article-title":"Budget feasible mechanism design","volume":"12","author":"Singer Yaron","year":"2013","unstructured":"Yaron Singer. 2013. Budget feasible mechanism design. SIGecom Exchanges 12, 2 (2013), 24\u201331.","journal-title":"SIGecom Exchanges"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488489"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488490"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. of the 18th Symposium on Foundations of Computer Science (FOCS","author":"Chi-Chih Yao Andrew","year":"1977","unstructured":"Andrew Chi-Chih Yao. 1977. Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract). In Proc. of the 18th Symposium on Foundations of Computer Science (FOCS 1977). IEEE Computer Society, 222\u2013227."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3034499"}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:24Z","timestamp":1751482104000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":40,"alternative-id":["10.1145\/3736252.3742668","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742668","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}