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 条
  • [1] Revenue-maximizing pricing and scheduling strategies in service systems with flexible customers
    He, Qiao-Chu
    Chen, Ying-Ju
    [J]. OPERATIONS RESEARCH LETTERS, 2018, 46 (01) : 134 - 137
  • [2] A Revenue-Maximizing Bidding Strategy for Demand-Side Platforms
    Wang, Tengyun
    Yang, Haizhi
    Yu, Han
    Zhou, Wenjun
    Liu, Yang
    Song, Hengjie
    [J]. IEEE ACCESS, 2019, 7 : 68692 - 68706
  • [3] A NOTE ON REVENUE-MAXIMIZING OLIGOPOLY
    CLARKE, R
    [J]. JOURNAL OF ECONOMIC STUDIES, 1984, 11 (03) : 62 - 65
  • [4] Learning to bid in revenue-maximizing auctions
    Nedelec, Thomas
    El Karoui, Noureddine
    Perchet, Vianney
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [5] Mining Revenue-Maximizing Bundling Configuration
    Do, Loc
    Lauw, Hady W.
    Wang, Ke
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 8 (05): : 593 - 604
  • [6] Learning Revenue-Maximizing Auctions With Differentiable Matching
    Curry, Michael J.
    Lyi, Uro
    Goldstein, Tom
    Dickerson, John P.
    [J]. INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 151, 2022, 151 : 6062 - 6073
  • [7] Automated Design of Revenue-Maximizing Combinatorial Auctions
    Sandholm, Tuomas
    Likhodedov, Anton
    [J]. OPERATIONS RESEARCH, 2015, 63 (05) : 1000 - 1025
  • [8] Revenue-Maximizing Auctions: A Bidder's Standpoint
    Nedelec, Thomas
    Calauzenes, Clement
    Perchet, Vianney
    El Karoui, Noureddine
    [J]. OPERATIONS RESEARCH, 2022, 70 (05) : 2767 - 2783
  • [9] An equilibrium analysis of the revenue-maximizing multinational enterprise
    Hu, Songhua
    [J]. FRONTIERS OF ECONOMICS IN CHINA, 2008, 3 (03) : 482 - 495
  • [10] Implementation of the revenue-maximizing auction by an ignorant seller
    Caillaud B.
    Robert J.
    [J]. Review of Economic Design, 2005, 9 (2) : 127 - 143