Revenue-Maximizing Mechanisms with Strategic Customers and Unknown, Markovian Demand

被引:11
|
作者
Gershkov, Alex [1 ,2 ,3 ]
Moldovanu, Benny [4 ]
Strack, Philipp [5 ]
机构
[1] Hebrew Univ Jerusalem, Dept Econ, IL-91905 Jerusalem, Israel
[2] Hebrew Univ Jerusalem, Ctr Study Rat, IL-91905 Jerusalem, Israel
[3] Univ Surrey, Sch Econ, Guildford GU2 7XH, Surrey, England
[4] Univ Bonn, Dept Econ, D-53012 Bonn, Germany
[5] Univ Calif Berkeley, Dept Econ, Berkeley, CA 94720 USA
基金
以色列科学基金会; 欧洲研究理事会;
关键词
revenue management; strategic consumer behavior; name your own price; Markov arrival process; SEARCH; DESIGN; AUCTIONS; MAXIMIZATION; INFORMATION; PRODUCTS;
D O I
10.1287/mnsc.2017.2724
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We show that appropriate dynamic pricing strategies can be used to draw benefits from the presence of consumers who strategically time their purchase even if the arrival process is not known. In our model, a seller sells a stock of objects to a stream of randomly arriving long-lived agents. Agents are privately informed about their values, and about their arrival time to the market. The seller needs to learn about future demand from past arrivals. We characterize the revenue-maximizing direct mechanism. While the optimal mechanism cannot be reduced to posted prices (and requires personalized prices), we also present a simple, "learn and then sell" mechanism that is able to extract a large fraction of the maximal revenue. In this mechanism, the seller first charges a relatively low price that allows learning about the arrival process, and in a second stage, the seller charges the optimal posted price given the previously obtained information.
引用
收藏
页码:2031 / 2046
页数:16
相关论文
共 50 条
  • [21] Revenue-maximizing pricing and resource allocation in a multi-service network
    Xie, XC
    Wang, XY
    [J]. 2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS, 2003, : 135 - 138
  • [22] TAX ABATEMENT AND TAX RATES IN A SYSTEM OF OVERLAPPING REVENUE-MAXIMIZING GOVERNMENTS
    BECK, JH
    [J]. REGIONAL SCIENCE AND URBAN ECONOMICS, 1993, 23 (05) : 645 - 665
  • [23] Revenue-maximizing virtualized network function chain placement in dynamic environment
    Xie, Yanghao
    Wang, Sheng
    Dai, Yueyue
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 108 : 650 - 661
  • [24] Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers
    L'Ecuyer, Pierre
    Maille, Patrick
    Stier-Moses, Nicolas E.
    Tuffin, Bruno
    [J]. OPERATIONS RESEARCH, 2017, 65 (02) : 408 - 423
  • [25] Revenue-maximizing pricing and capacity expansion in a many-users regime
    Basar, T
    Srikant, R
    [J]. IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 294 - 301
  • [26] Value of Dynamic Revenue-Maximizing Congestion Pricing in a Highly Congested Corridor
    El Khoury, John
    Srour, F. Jordan
    [J]. JOURNAL OF TRANSPORTATION ENGINEERING, 2015, 141 (12)
  • [27] Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs
    Balcan, Maria-Florina
    Prasad, Siddharth
    Sandholm, Tuomas
    [J]. PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 332 - 338
  • [28] Revenue-maximizing online stable task assignment on taxi-dispatching platforms
    Jingwei Lv
    Ze Zhao
    Shuzhen Yao
    Weifeng Lv
    [J]. Frontiers of Computer Science, 2022, 16
  • [29] Revenue-maximizing online stable task assignment on taxi-dispatching platforms
    Jingwei LV
    Ze ZHAO
    Shuzhen YAO
    Weifeng LV
    [J]. Frontiers of Computer Science., 2022, 16 (06) - 173
  • [30] Revenue-maximizing online stable task assignment on taxi-dispatching platforms
    Lv, Jingwei
    Zhao, Ze
    Yao, Shuzhen
    Lv, Weifeng
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (06)