Two-stage Pandora ’ s Box for Product Ranking

In online platforms, consumers face an abundance of options that are displayed in the form of a position ranking. Only products placed in the first few positions are readily accessible to the consumer, and she needs to exert effort to access more options. We study how platforms with different business models should rank products to maximize their profit. We provide empirical evidence from a large online platform that products placed in higher positions have a favorable chance of being selected regardless of their utility. Further, the externality that high-positioned products impose on low-positioned ones substantially increases with their utility. Motivated by our empirical evidence, and building upon the seminal work of Weitzman (1979) (also known as the Pandora’s box), we develop a two-stage sequential search model; in the first stage, the consumer learns the intrinsic utility of products, already known to the platform, and forms a consideration set. While in the second stage, she inspects the products in her consideration set to learn the additional idiosyncratic utility she derives from a product. We develop optimal or FPTAS ranking algorithms under two diametric business models: one only concerned with maximizing consumer welfare a suitable objective for platforms seeking consumer’s long-term engagement and one concerned with maximizing short-term revenue. Further, somewhat surprisingly, we show that ranking products in a decreasing order of their intrinsic utilities does not necessarily maximize consumer welfare. Such ranking may shorten the consumer’s consideration set, due to the externality effect, leading to insufficient exploration.

[1]  Aydin Alptekinoglu,et al.  Learning Consumer Tastes through Dynamic Assortments , 2012, Oper. Res..

[2]  P. Rusmevichientong,et al.  Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters , 2014 .

[3]  Lei Xie,et al.  Dynamic Assortment Customization with Limited Inventories , 2015, Manuf. Serv. Oper. Manag..

[4]  Fernando Bernstein,et al.  A Dynamic Clustering Approach to Data-Driven Assortment Personalization , 2018, Manag. Sci..

[5]  David B. Shmoys,et al.  Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint , 2010, Oper. Res..

[6]  Danny Segev,et al.  Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences , 2015, Manag. Sci..

[7]  Nimrod Megiddo Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[8]  Retsef Levi,et al.  Assortment Optimization Under Consider-Then-Choose Choice Models , 2015, Manag. Sci..

[9]  E. Glen Weyl,et al.  Descending Price Optimally Coordinates Search , 2016, EC.

[10]  Glenn Ellison,et al.  Position Auctions with Consumer Search , 2007 .

[11]  K. Ferreira,et al.  The Impact of Increasing Search Frictions on Online Shopping Behavior: Evidence from a Field Experiment , 2019, Journal of Marketing Research.

[12]  Yuxin Chen,et al.  Sequential Search with Refinement: Model and Application with Click-Stream Data , 2017, Manag. Sci..

[13]  John R. Hauser,et al.  Consideration-set heuristics ☆ , 2014 .

[14]  Vashist Avadhanula,et al.  A Near-Optimal Exploration-Exploitation Approach for Assortment Selection , 2016, EC.

[15]  Heng Zhang,et al.  Position Ranking and Auctions for Online Marketplaces , 2017, Manag. Sci..

[16]  M. Weitzman Optimal search for the best alternative , 1978 .

[17]  Babur De los Santos,et al.  Optimizing Click-through in Online Rankings for Partially Anonymous Consumers , 2017 .

[18]  Hamid Nazerzadeh,et al.  Real-time optimization of personalized assortments , 2013, EC.

[19]  Vineet Goyal,et al.  Near-Optimal Algorithms for Capacity Constrained Assortment Optimization , 2014 .

[20]  John Roberts,et al.  Development and Testing of a Model of Consideration Set Composition , 1991 .

[21]  G. Gallego,et al.  Assortment Planning Under the Multinomial Logit Model with Totally Unimodular Constraint Structures , 2013 .

[22]  Mark Armstrong,et al.  Ordered Consumer Search , 2016 .

[23]  I. Segal,et al.  What Makes Them Click: Empirical Analysis of Consumer Demand for Search Advertising , 2012 .

[24]  Pascal Van Hentenryck,et al.  Optimizing Expected Utility in a Multinomial Logit Model with Position Bias and Social Influence , 2014, ArXiv.

[25]  Beibei Li,et al.  Examining the Impact of Ranking on Consumer Behavior and Search Engine Revenue , 2013, Manag. Sci..

[26]  Özge Sahin,et al.  The Impact of Consumer Search Cost on Assortment Planning and Pricing , 2014, Manag. Sci..

[27]  Donald Ngwe Why Outlet Stores Exist: Averting Cannibalization in Product Line Extensions , 2017, Mark. Sci..

[28]  Yi Xu,et al.  On the Effects of Consumer Search and Firm Entry in a Multiproduct Competitive Market , 2008, Mark. Sci..

[29]  Jon Feldman,et al.  Sponsored Search Auctions with Markovian Users , 2008, WINE.

[30]  Yi Xu,et al.  Retail Assortment Planning in the Presence of Consumer Search , 2005, Manuf. Serv. Oper. Manag..

[31]  Eugene L. Lawler,et al.  Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..

[32]  Patrick Hummel,et al.  Position Auctions with Externalities and Brand Effects , 2014, ArXiv.

[33]  Zizhuo Wang,et al.  Consumer Choice Models with Endogenous Network Effects , 2014, Manag. Sci..

[34]  Bart J. Bronnenberg,et al.  Online Demand Under Limited Consumer Search , 2009, Mark. Sci..

[35]  Omar Besbes,et al.  Product Assortment and Price Competition Under Multinomial Logit Demand , 2014 .

[36]  Kenneth Train,et al.  Diagnostic tests for the independence from irrelevant alternatives property of the multinomial logit model , 1976 .

[37]  Marco Scarsini,et al.  Social Learning from Online Reviews with Product Choice , 2018, NetEcon@SIGMETRICS.

[38]  John R. Hauser,et al.  Testing the Accuracy, Usefulness, and Significance of Probabilistic Choice Models: An Information-Theoretic Approach , 1978, Oper. Res..

[39]  Srikanth Jagabathula,et al.  A Nonparametric Joint Assortment and Price Choice Model , 2015, Manag. Sci..

[40]  Mohammad Mahdian,et al.  A Cascade Model for Externalities in Sponsored Search , 2008, WINE.

[41]  Van-Anh Truong,et al.  Approximation Algorithms for Product Framing and Pricing , 2018, Oper. Res..

[42]  Raluca Mihaela Ursu The Power of Rankings: Quantifying the Effect of Rankings on Online Consumer Search and Purchase Decisions , 2018 .

[43]  J. Blanchet,et al.  A markov chain approximation to choice modeling , 2013, EC '13.

[44]  Madeleine Udell,et al.  Dynamic Assortment Personalization in High Dimensions , 2016, Oper. Res..