Mathematics > Optimization and Control
This paper has been withdrawn by Dana Pizarro
[Submitted on 10 Aug 2021 (v1), last revised 20 Aug 2021 (this version, v2)]
Title:Optimal Revenue Guarantees for Pricing in Large Markets
No PDF available, click to view other formatsAbstract:Posted price mechanisms (PPM) constitute one of the predominant practices to price goods in online marketplaces and their revenue guarantees have been a central object of study in the last decade. We consider a basic setting where the buyers' valuations are independent and identically distributed and there is a single unit on sale. It is well-known that this setting is equivalent to the so-called i.i.d. prophet inequality, for which optimal guarantees are known and evaluate to 0.745 in general (equivalent to a PPM with dynamic prices) and $1 - 1/e \approx 0.632$ in the fixed threshold case (equivalent to a fixed price PPM). In this paper we consider an additional assumption, namely, that the underlying market is very large. This is modeled by first fixing a valuation distribution F and then making the number of buyers grow large, rather than considering the worst distribution for each possible market size. In this setting Kennedy and Kertz [Ann. Probab. 1991] breaks the 0.745 fraction achievable in general with a dynamic threshold policy. We prove that this large market benefit continue to hold when using fixed price PPMs, and show that the guarantee of 0.632 actually improves to 0.712. We then move to study the case of selling k identical units and we prove that the revenue gap of the fixed price PPM approaches $1-1/\sqrt{ 2k\pi}$. As this bound is achievable without the large market assumption, we obtain the somewhat surprising result that the large market advantage vanishes as $k$ grows.
Submission history
From: Dana Pizarro [view email] [via CCSD proxy][v1] Tue, 10 Aug 2021 08:18:20 UTC (38 KB)
[v2] Fri, 20 Aug 2021 12:08:21 UTC (1 KB) (withdrawn)
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.