Nikhil Bansal
Abstract
We study the following problem related to pricing over time. Assume there is a collection of bidders, each of whom is interested in buying a copy of an item of which there is an unlimited supply. Every bidder is associated with a time interval over which the bidder will consider buying a copy of the item, and a maximum value the bidder is willing to pay for the item. On every time unit, the seller sets a price for the item. The seller's goal is to set the prices so as to maximize revenue from the sale of copies of items over the time period.
In the first model considered, we assume that all bidders are impatient, that is, bidders buy the item at the first time unit within their bid interval that they can afford the price. To the best of our knowledge, this is the first work that considers this model. In the offline setting, we assume that the seller knows the bids of all the bidders in advance. In the online setting we assume that at each time unit the seller only knows the values of the bids that have arrived before or at that time unit. We give a polynomial time offline algorithm and prove upper and lower bounds on the competitiveness of deterministic and randomized online algorithms, compared with the optimal offline solution. The gap between the upper and lower bounds is quadratic.
We also consider the envy-free model in which bidders are sold the item at the minimum price during their bid interval, as long as it is not over their limit value. We prove tight bounds on the competitiveness of deterministic online algorithms for this model, and upper and lower bounds on the competitiveness of randomized algorithms with quadratic gap. The lower bounds for the randomized case in both models use a novel general technique.
- Blum, A., and Hartline, J. 2005. Near-optimal online auctions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 1156--1163. Google Scholar
Digital Library
- Blum, A., Kumar, V., Rudra, A., and Wu, F. 2004. Online learning in online auctions. Theoret. Comput. Sci. 324, 2-3, 137--146. Google ScholarDigital Library
- Borodin, A., and El-Yaniv, R. 1998. On-Line Computation and Competitive Analysis. Cambridge University Press, Cambridge, MA. Google ScholarDigital Library
- Goldberg, A., Hartline, J., Karlin, A. R., Saks, M., and Wright, A. 2006. Competitive auctions. Games Econ. Behav. 55, 2, 242--269.Google ScholarCross Ref
- Guruswami, V., Hartline, J., Karlin, A., Kempe, D., Kenyon, C., and McSherry, F. 2005. On profit-maximizing envy-free pricing. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA). ACM, New York, 1164--1173. Google ScholarDigital Library
- Hajiaghayi, M. T., Kleinberg, R. D., Mahdian, M., and Parkes, D. C. 2005. Online auctions with re-usable goods. In Proceedings of the ACM Conference on Electronic Commerce (EC). ACM, New York, 165--174. Google ScholarDigital Library
- Hajiaghayi, M. T., Kleinberg, R. D., and Parkes, D. C. 2004. Adaptive limited-supply auctions. In Proceedings of the ACM Conference on Electronic Commerce (EC). ACM, New York, 71--80. Google ScholarDigital Library
- Lavi, R., and Nisan, N. 2005. Online ascending auctions for gradually expiring items. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 1146--1155. Google ScholarDigital Library
Index Terms
- Dynamic pricing for impatient bidders
Recommendations
Nonlinear Pricing of Information Goods
This paper analyzes optimal pricing for information goods under incomplete information, when both unlimited-usage (fixed-fee) pricing and usage-based pricing are feasible and administering usage-based pricing may involve transaction costs. It is shown ...
Online pricing with impatient bidders
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithmsIn this paper we consider the following online pricing problem. An auctioneer is selling identical items in unlimited supply, whereas each bidder from a given set is interested in purchasing a single copy of the item. Each bidder is characterized by a ...
Dynamic pricing for impatient bidders
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithmsWe study the following problem related to pricing over time. Assume there is a collection of bidders, each of whom is interested in buying a copy of an item of which there is an unlimited supply. Every bidder is associated with a time interval over ...
Comments