### 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 uses a novel general technique.

Original language | English |
---|---|

Title of host publication | Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07, New Orleans LA, USA, January 7-9, 2007) |

Place of Publication | New York |

Publisher | Association for Computing Machinery, Inc |

Pages | 726-735 |

ISBN (Print) | 978-0-898716-24-5 |

Publication status | Published - 2007 |

## Fingerprint Dive into the research topics of 'Dynamic pricing for impatient bidders'. Together they form a unique fingerprint.

## Cite this

Bansal, N., Chen, N., Cherniavsky, N., Rudra, A., Schieber, B., & Sviridenko, M. (2007). Dynamic pricing for impatient bidders. In

*Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07, New Orleans LA, USA, January 7-9, 2007)*(pp. 726-735). Association for Computing Machinery, Inc.