JOURNAL ARTICLE

Dynamic and Non-uniform Pricing Strategies for Revenue Maximization

Abstract

We study the ITEM PRICING problem for revenue maximization in the limited supply setting, where a single seller with n distinct items caters to m buyers with unknown subadditive valuation functions who arrive in a sequence. The seller sets the prices on individual items. Each buyer buys a subset of yet unsold items that maximizes her utility. Our goal is to design pricing strategies that guarantee an expected revenue that is within a small multiplicative factor of the optimal social welfare - an upper bound on the maximum revenue that can be generated by any pricing mechanism. Most earlier work has focused on the unlimited supply setting, where selling an item to a buyer does not affect the availability of the item to the future buyers. Recently, Balcan et. al. [4] studied the limited supply setting, giving a randomized pricing strategy that achieves a 2 O(√logn log log n)-approximation; their strategy assigns a single price to all items (uniform pricing), and never changes it (static pricing). They also showed that no pricing strategy that is both static and uniform can give better than 2 Ω(log 1/4 n)-approximation. Our first result is a strengthening of the lower bound on approximation achievable by static uniform pricing to 2 Ω(√log n). We then design dynamic uniform pricing strategies (all items are identically priced but item prices can change over time), that achieves O(log 2 n)-approximation, and also show a lower bound of Ω ((log n/log log n) 2) for this class of strategies. Our strategies are simple to implement, and in particular, one strategy is to smoothly decrease the price over time. We also design a static nonuniform pricing strategy (different items can have different prices but prices do not change over time), that give poly-logarithmic approximation in a more restricted setting with few buyers. Thus in the limited supply setting, our results highlight a strong separation between the power of dynamic and non-uniform pricing strategies versus static uniform pricing strategy. To our knowledge, this is the first non-trivial analysis of dynamic and non-uniform pricing schemes for revenue maximization in a setting with multiple distinct items. © 2009 IEEE.

Keywords:
Revenue Valuation (finance) Multiplicative function Upper and lower bounds Computer science Mathematical economics Subadditivity Approximation algorithm Mathematical optimization Dynamic pricing Microeconomics Combinatorics Economics Mathematics Algorithm Finance

Metrics

21
Cited By
3.87
FWCI (Field Weighted Citation Impact)
25
Refs
0.94
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Auction Theory and Applications
Social Sciences →  Decision Sciences →  Management Science and Operations Research
Optimization and Search Problems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mobile Crowdsensing and Crowdsourcing
Physical Sciences →  Computer Science →  Computer Science Applications

Related Documents

JOURNAL ARTICLE

Dynamic and Nonuniform Pricing Strategies for Revenue Maximization

Tanmoy ChakrabortyZhiyi HuangSanjeev Khanna

Journal:   SIAM Journal on Computing Year: 2013 Vol: 42 (6)Pages: 2424-2451
JOURNAL ARTICLE

Dynamic Road Pricing for Revenue Maximization

Ahmed HassanKhaled AbdelghanyJohn H. Semple

Journal:   Transportation Research Record Journal of the Transportation Research Board Year: 2013 Vol: 2345 (1)Pages: 100-108
JOURNAL ARTICLE

Dynamic Cloud Pricing for Revenue Maximization

Hong XuBaochun Li

Journal:   IEEE Transactions on Cloud Computing Year: 2013 Vol: 1 (2)Pages: 158-171
© 2026 ScienceGate Book Chapters — All rights reserved.