Calibrated Click-Through Auctions

被引:2
|
作者
Bergemann, Dirk [1 ]
Dutting, Paul [2 ]
Leme, Renato Paes [2 ]
Zuo, Song [2 ]
机构
[1] Yale Univ, New Haven, CT USA
[2] Google Res, Mountain View, CA USA
关键词
second-price auction; stochastic click-through rates; revenue maximization;
D O I
10.1145/3485447.3512050
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We analyze the optimal information design in a click-through auction with stochastic click-through rates and known valuations per click. The auctioneer takes as given the auction rule of the click-through auction, namely the generalized second-price auction. Yet, the auctioneer can design the information flow regarding the clickthrough rates among the bidders. We require that the information structure to be calibrated in the learning sense. With this constraint, the auction needs to rank the ads by a product of the value and a calibrated prediction of the click-through rates. The task of designing an optimal information structure is thus reduced to the task of designing an optimal calibrated prediction. We show that in a symmetric setting with uncertainty about the click-through rates, the optimal information structure attains both social efficiency and surplus extraction. The optimal information structure requires private (rather than public) signals to the bidders. It also requires correlated (rather than independent) signals, even when the underlying uncertainty regarding the click-through rates is independent. Beyond symmetric settings, we show that the optimal information structure requires partial information disclosure, and achieves only partial surplus extraction.
引用
收藏
页码:47 / 57
页数:11
相关论文
共 50 条
  • [1] Loss functions for predicted click-through rates in auctions for online advertising
    Hummel, Patrick
    McAfee, R. Preston
    [J]. JOURNAL OF APPLIED ECONOMETRICS, 2017, 32 (07) : 1314 - 1328
  • [2] XML For Click-Through Contracts
    Ahmad, Imtinan
    Kim, Hong
    Leff, Laurence
    Greenwood, Daniel
    [J]. INTERNATIONAL JOURNAL OF LAW AND INFORMATION TECHNOLOGY, 2009, 17 (02): : 206 - 219
  • [3] Click-Through Prediction for News Queries
    Koenig, Arnd Christian
    Gamon, Michael
    Wu, Qiang
    [J]. PROCEEDINGS 32ND ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2009, : 347 - 354
  • [4] Factors affecting click-through rate
    Chandon, JL
    Chtourou, MS
    [J]. ONLINE CONSUMER PSYCHOLOGY: UNDERSTANDING AND INFLUENCING CONSUMER BEHAVIOR IN THE VIRTUAL WORLD, 2005, : 143 - 165
  • [5] Click fraud resistant methods for learning click-through rates
    Immorlica, N
    Jain, K
    Mahdian, M
    Talwar, K
    [J]. INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2005, 3828 : 34 - 45
  • [6] Click-through Prediction for Advertising in Twitter Timeline
    Li, Cheng
    Lu, Yue
    Mei, Qiaozhu
    Wang, Dong
    Pandey, Sandeep
    [J]. KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, : 1959 - 1968
  • [7] Advertising on the Web: Is there response before click-through?
    Briggs, R
    Hollis, N
    [J]. JOURNAL OF ADVERTISING RESEARCH, 1997, 37 (02) : 33 - 45
  • [8] To Regulate Tech, Nullify Click-Through Contracts
    Vardi, Moshe Y.
    [J]. COMMUNICATIONS OF THE ACM, 2023, 66 (09) : 5 - 5
  • [9] Exploiting Click-Through Data for Entity Retrieval
    Billerbeck, Bodo
    Demartini, Gianluca
    Firan, Claudiu S.
    Iofciu, Tereza
    Krestel, Ralf
    [J]. SIGIR 2010: PROCEEDINGS OF THE 33RD ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH DEVELOPMENT IN INFORMATION RETRIEVAL, 2010, : 803 - 804
  • [10] Open Benchmarking for Click-Through Rate Prediction
    Zhu, Jieming
    Liu, Jinyang
    Yang, Shuai
    Zhang, Qi
    He, Xiuqiang
    [J]. PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 2759 - 2769