Power of Posted-price Mechanisms for Prophet Inequalities
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
摘要
We study the power of posted pricing mechanisms for Bayesian online optimization problems subject to combinatorial feasibility constraints. When the objective is to maximize social welfare, the problem is widely studied in the literature on prophet inequalities. While most (though not all) existing algorithms for prophet inequalities are implemented using a pricing mechanism, whether or not this can be done in general is unknown, and was formally left as an open question by Dutting, Feldman, Kesselheim, and Lucier (FOCS 2017, SICOMP 2020). Understanding the power and limitations of posted prices is important from a mechanism design perspective because any posted price mechanism is truthful, and is also interesting in its own right as it can guide future research on prophet inequalities.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper4
- Single-Sample and Robust Online Resource AllocationRohan Ghuge, Sahil Singla, Yifan WangSTOC 2025 · 被引用 8 次
- New Philosopher Inequalities for Online Bayesian Matching, via Pivotal SamplingMark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi 等SODA 2025 · 被引用 3 次
- Replicable Online pricingKiarash Banihashem, MohammadHossein Bateni, Hossein Esfandiari, Samira Goudarzi 等NeurIPS 2025
- Online Combinatorial Allocations and Auctions with Few SamplesPaul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser 等FOCS 2024
相关 Paper
- An O(log log m) Prophet Inequality for Subadditive Combinatorial AuctionsPaul Dütting, Thomas Kesselheim, Brendan LucierFOCS 2020 · 被引用 22 次
- On Multi-Dimensional Gains from Trade MaximizationYang Cai, Kira Goldner, Steven Ma, Mingfei ZhaoSODA 2021 · 被引用 10 次
- Fully Dynamic Online Selection through Online Contention Resolution SchemesVashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi 等AAAI 2023 · 被引用 1 次
- A Constant Factor Prophet Inequality for Online Combinatorial AuctionsJosé Correa, Andrés CristiSTOC 2023 · 被引用 18 次
- Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic KnapsackJiashuo Jiang, Will Ma, Jiawei ZhangSODA 2022 · 被引用 20 次
