期刊
OPERATIONS RESEARCH
卷 60, 期 6, 页码 1537-1550出版社
INFORMS
DOI: 10.1287/opre.1120.1103
关键词
-
资金
- National Science Foundation [DMI-0447562]
- Binational Science Foundation [2006075]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0964170] Funding Source: National Science Foundation
We consider a general class of network revenue management problems, where mean demand at each point in time is determined by a vector of prices, and the objective is to dynamically adjust these prices so as to maximize expected revenues over a finite sales horizon. A salient feature of our problem is that the decision maker can only observe realized demand over time but does not know the underlying demand function that maps prices into instantaneous demand rate. We introduce a family of blind pricing policies that are designed to balance trade-offs between exploration (demand learning) and exploitation (pricing to optimize revenues). We derive bounds on the revenue loss incurred by said policies in comparison to the optimal dynamic pricing policy that knows the demand function a priori, and we prove that asymptotically, as the volume of sales increases, this gap shrinks to zero.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据