Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH,
Published online in Articles in Advance, April 24, 2009
DOI: 10.1287/opre.1080.0640
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Besbes, O.
Right arrow Articles by Zeevi, A.
Right arrow Search for Related Content

Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms

Omar Besbes, Assaf Zeevi

The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104
Graduate School of Business, Columbia University, New York, New York 10027

obesbes{at}wharton.upenn.edu
assaf{at}gsb.columbia.edu

We consider a single-product revenue management problem where, given an initial inventory, the objective is to dynamically adjust prices over a finite sales horizon to maximize expected revenues. Realized demand is observed over time, but the underlying functional relationship between price and mean demand rate that governs these observations (otherwise known as the demand function or demand curve) is not known. We consider two instances of this problem: (i) a setting where the demand function is assumed to belong to a known parametric family with unknown parameter values; and (ii) a setting where the demand function is assumed to belong to a broad class of functions that need not admit any parametric representation. In each case we develop policies that learn the demand function "on the fly," and optimize prices based on that. The performance of these algorithms is measured in terms of the regret: the revenue loss relative to the maximal revenues that can be extracted when the demand function is known prior to the start of the selling season. We derive lower bounds on the regret that hold for any admissible pricing policy, and then show that our proposed algorithms achieve a regret that is "close" to this lower bound. The magnitude of the regret can be interpreted as the economic value of prior knowledge on the demand function, manifested as the revenue loss due to model uncertainty.

Subject classifications: revenue management; pricing; estimation; learning; exploration-exploitation; value of information; asymptotic analysis.
History: Received June 2007; revision received June 2008; accepted June 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH
Copyright © 2009 by INFORMS.