Multidimensional Dynamic Pricing for Welfare Maximization
Open Access
- 29 February 2020
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Economics and Computation
- Vol. 8 (1) , 1-35
Abstract
We study the problem of a seller dynamically pricing d distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply, but can only be produced at a limited rate and are costly to produce. The seller observes only the bundle of goods purchased at each day, but nothing else about the buyer’s valuation function. Our main result is a dynamic pricing algorithm for optimizing welfare (including the seller’s cost of production) that runs in time and a number of rounds that are polynomial in d and the approximation parameter. We are able to do this despite the fact that (i) the price-response function is not continuous, and even its fractional relaxation is a non-concave function of the prices, and (ii) the welfare is not observable to the seller. We derive this result as an application of a general technique for optimizing welfare over divisible goods, which is of independent interest. When buyers have strongly concave, Hölder continuous valuation functions over d divisible goods, we give a general polynomial time dynamic pricing technique. We are able to apply this technique to the setting of unit-demand buyers despite the fact that in that setting the goods are not divisible, and the natural fractional relaxation of a unit-demand valuation is not strongly concave. To apply our general technique, we introduce a novel price randomization procedure that has the effect of implicitly inducing buyers to “regularize” their valuations with a strongly concave function. Finally, we also extend our results to a limited-supply setting in which the supply of each good cannot be replenished.Keywords
Funding Information
- Sloan Foundation Fellowship
- NSF (CNS-1253345)
- DARPA
This publication has 24 references indexed in Scilit:
- Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management ProblemsOperations Research, 2014
- Dynamic and Nonuniform Pricing Strategies for Revenue MaximizationSIAM Journal on Computing, 2013
- Stochastic Convex Optimization with Bandit FeedbackSIAM Journal on Optimization, 2013
- Blind Network Revenue ManagementOperations Research, 2012
- Dynamic Pricing Under a General Parametric Choice ModelOperations Research, 2012
- Efficiently Learning from Revealed PreferenceLecture Notes in Computer Science, 2012
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal AlgorithmsOperations Research, 2009
- The Construction of Utility Functions from Expenditure DataInternational Economic Review, 1967
- On general minimax theoremsPacific Journal of Mathematics, 1958
- A Note on the Pure Theory of Consumer's BehaviourEconomica, 1938