The Power of Static Pricing for Reusable Resources
Adam N. Elmachtoub, Jiaqi Shi

TL;DR
This paper demonstrates that simple static pricing policies can achieve near-optimal revenue in reusable resource systems with general service times, multiple customer classes, and complex valuation distributions.
Contribution
It proves the near-optimality of static pricing policies across various settings and provides the first polynomial-time algorithm for computing such policies in multi-class scenarios.
Findings
Static policies are universally near-optimal for any service distribution and system size.
Static pricing guarantees at least 78.9% of the optimal revenue in multi-class settings.
A polynomial-time algorithm can compute optimal static prices for multi-class systems.
Abstract
We consider the problem of pricing a reusable resource service system. Potential customers arrive according to a Poisson process and purchase the service if their valuation exceeds the current price. If no units are available, customers immediately leave without service. Serving a customer corresponds to using one unit of the reusable resource, where the service time has a general distribution. The objective is to maximize the steady-state revenue rate. This system is equivalent to the classical Erlang loss model with price-sensitive customers, which has applications in vehicle sharing, cloud computing, and spare parts management. With general service times, the optimal pricing policy depends not only on the number of customers currently in the system but also on how long each unavailable unit has been in use. We prove several results that show a simple static policy is universally…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTransportation and Mobility Innovations · Energy, Environment, and Transportation Policies · Advanced Queuing Theory Analysis
