Incentive-Compatible Assortment Optimization for Sponsored Products

被引:1
|
作者
Balseiro, Santiago R. [1 ]
Desir, Antoine [2 ]
机构
[1] Columbia Univ, Grad Sch Business, New York, NY 10027 USA
[2] INSEAD, Technol & Operat Management, F-77305 Fontainebleau, France
关键词
online retailing; sponsored advertising; assortment optimization; mechanism design; information externalities; CHOICE MODEL; AUCTIONS; EXTERNALITIES; DESIGN;
D O I
10.1287/mnsc.2022.4603
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Online marketplaces, such as Amazon, Alibaba, Google Shopping, and JD.com, allow sellers to promote their products by charging them for the right to be displayed on top of organic search results. In this paper, we study the problem of designing auctions for sponsored products and highlight some new challenges emerging from the interplay of two unique features: substitution effects and information asymmetry. The presence of substitution effects, which we capture by assuming that consumers choose sellers according to a multinomial logit model, implies that the probability a seller is chosen depends on the assortment of sellers displayed alongside. Additionally, sellers may hold private information about how their own products match consumers' interests, which the platform can elicit to make better assortment decisions. We first show that the first-best allocation, that is, the welfare-maximizing assortment in the absence of private information, cannot be implemented truthfully in general. Thus motivated, we initiate the study of incentive-compatible assortment optimization by characterizing prior-independent and prior-dependent mechanisms and quantifying the worst-case social cost of implementing truthful assortment mechanisms. An important finding is that the worst-case social cost of implementing truthful mechanisms can be high when the number of sellers is large. Structurally, we show that optimal mechanisms may need to downward distort the efficient allocation both at the top and the bottom.
引用
收藏
页码:4668 / 4684
页数:17
相关论文
共 50 条
  • [31] Incentive-Compatible Opportunistic Routing for Wireless Networks
    Wu, Fan
    Chen, Tingting
    Zhong, Sheng
    Li, Li Erran
    Yang, Yang Richard
    MOBICOM'08: PROCEEDINGS OF THE FOURTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2008, : 303 - +
  • [32] BRICK: Asynchronous Incentive-Compatible Payment Channels
    Avarikioti, Zeta
    Kokoris-Kogias, Eleftherios
    Wattenhofer, Roger
    Zindros, Dionysis
    FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2021, PT II, 2021, 12675 : 209 - 230
  • [33] Optimal Algorithm for Bayesian Incentive-Compatible Exploration
    Cohen, Lee
    Mansour, Yishay
    ACM EC '19: PROCEEDINGS OF THE 2019 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2019, : 135 - 151
  • [34] Incentive-compatible interdomain routing with linear utilities
    Hall, Alexander
    Nikolova, Evdokia
    Papadimitriou, Christos
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2007, 4858 : 232 - +
  • [35] Optimal incentive-compatible mechanisms in active systems
    Enaleev, A. K.
    AUTOMATION AND REMOTE CONTROL, 2013, 74 (03) : 491 - 505
  • [36] INCENTIVE-COMPATIBLE COST-ALLOCATION SCHEMES
    SCHMEIDLER, D
    TAUMAN, Y
    JOURNAL OF ECONOMIC THEORY, 1994, 63 (02) : 189 - 207
  • [37] Incentive-compatible online auctions for digital goods
    Bar-Yossef, Z
    Hildrum, K
    Wu, F
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 964 - 970
  • [38] On the Foundations of Ex Post Incentive-Compatible Mechanisms
    Yamashita, Takuro
    Zhu, Shuguang
    AMERICAN ECONOMIC JOURNAL-MICROECONOMICS, 2022, 14 (04) : 494 - 514
  • [39] No-Regret and Incentive-Compatible Online Learning
    Freeman, Rupert
    Pennock, David M.
    Podimata, Chara
    Vaughan, Jennifer Wortman
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [40] Incentive-Compatible Selection for One or Two Influentials
    Zhao, Yuxin
    Zhang, Yao
    Zhao, Dengji
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 2931 - 2938