Computer Science > Computer Science and Game Theory
[Submitted on 11 Oct 2022 (v1), last revised 14 Aug 2023 (this version, v3)]
Title:The IID Prophet Inequality with Limited Flexibility
View PDFAbstract:In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave fashion. Buyers can sometimes see posted prices faced by other buyers, and changing the price frequently could be considered unfair. The literature on posted price mechanisms and prophet inequality problems has studied the two extremes of pricing policies, the fixed price policy and fully dynamic pricing. The former is suboptimal in revenue but is perceived as fairer than the latter. This work examines the middle situation, where there are at most $k$ distinct prices over the selling horizon. Using the framework of prophet inequalities with independent and identically distributed random variables, we propose a new prophet inequality for strategies that use at most $k$ thresholds. We present asymptotic results in $k$ and results for small values of $k$. For $k=2$ prices, we show an improvement of at least $11\%$ over the best fixed-price solution. Moreover, $k=5$ prices suffice to guarantee almost $99\%$ of the approximation factor obtained by a fully dynamic policy that uses an arbitrary number of prices. From a technical standpoint, we use an infinite-dimensional linear program in our analysis; this formulation could be of independent interest to other online selection problems.
Submission history
From: Sebastian Perez-Salazar [view email][v1] Tue, 11 Oct 2022 17:26:18 UTC (134 KB)
[v2] Thu, 8 Dec 2022 23:44:14 UTC (137 KB)
[v3] Mon, 14 Aug 2023 01:56:41 UTC (151 KB)
Current browse context:
cs.GT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.