Power of Posted-price Mechanisms for Prophet Inequalities
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
Abstract
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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 4b337d9b-63c0-4a0c-bffc-d97c68f21464Cited by top-tier papers4
- Single-Sample and Robust Online Resource AllocationRohan Ghuge, Sahil Singla, Yifan WangSTOC 2025 · 8 citations
- New Philosopher Inequalities for Online Bayesian Matching, via Pivotal SamplingMark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi et al.SODA 2025 · 3 citations
- Replicable Online pricingKiarash Banihashem, MohammadHossein Bateni, Hossein Esfandiari, Samira Goudarzi et al.NeurIPS 2025
- Online Combinatorial Allocations and Auctions with Few SamplesPaul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser et al.FOCS 2024
Related papers
- An O(log log m) Prophet Inequality for Subadditive Combinatorial AuctionsPaul Dütting, Thomas Kesselheim, Brendan LucierFOCS 2020 · 22 citations
- On Multi-Dimensional Gains from Trade MaximizationYang Cai, Kira Goldner, Steven Ma, Mingfei ZhaoSODA 2021 · 10 citations
- Fully Dynamic Online Selection through Online Contention Resolution SchemesVashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi et al.AAAI 2023 · 1 citation
- A Constant Factor Prophet Inequality for Online Combinatorial AuctionsJosé Correa, Andrés CristiSTOC 2023 · 18 citations
- Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic KnapsackJiashuo Jiang, Will Ma, Jiawei ZhangSODA 2022 · 20 citations
