Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers

When a customer searches for a keyword at a classified ads website, at an online retailer, or at a search engine (SE), the platform has exponentially many choices in how to sort the output to the query. The two extremes are (a) to consider a ranking based on relevance only, which attracts more customers in the long run because of perceived quality, and (b) to consider a ranking based on the expected revenue to be generated by immediate conversions, which maximizes short-term revenue. Typically, these two objectives are not perfectly positively correlated and hence the main question is what middle ground between them should be chosen. We introduce stochastic models and propose effective solution methods that can be used to optimize the ranking considering long-term revenues. A key feature of our model is that customers are quality-sensitive and are attracted to the platform or driven away depending on the average relevance of the output. The proposed methods are of crucial importance in e-business and encompass: (i) classified ad websites which can favor paid ads by ranking them higher, (ii) online retailers which can rank products they sell according to buyers' interests and/or the margins these products have, (iii) SEs which can position the content that they serve higher in the output page than third-party content to keep users in their platforms for longer and earn more. This goes in detriment of just offering rankings based on relevance only and is directly linked to the current search neutrality debate.

[1]  Joshua D. Wright Defining and Measuring Search Bias: Some Preliminary Evidence , 2011 .

[2]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[3]  Ioana Popescu,et al.  Managing Retention in Service Relationships , 2014, Manag. Sci..

[4]  R. Vohra,et al.  Algorithmic Game Theory: Sponsored Search Auctions , 2007 .

[5]  W. Rudin Real and complex analysis , 1968 .

[6]  Sujin Kim,et al.  The stochastic root-finding problem: Overview, solutions, and open questions , 2011, TOMC.

[7]  Omar Besbes,et al.  Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment , 2009, Oper. Res..

[8]  Maurizio Naldi,et al.  Sponsored search auctions: an overview of research with emphasis on game theoretic aspects , 2012, Electronic Commerce Research.

[9]  Haim Mendelson,et al.  Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue , 1990, Oper. Res..

[10]  Konstantin Avrachenkov,et al.  Decomposition of the Google Pagerank and Optimal Linking Strategy Decomposition of the Google Pagerank and Optimal Linking Strategy , 2004 .

[11]  Jon Crowcroft,et al.  Net neutrality: the technical side of the debate: a white paper , 2007, CCRV.

[12]  Bruno Tuffin,et al.  Telecommunication Network Economics: From Theory to Applications , 2014 .

[13]  Dimitri P. Bertsekas,et al.  Stochastic optimal control : the discrete time case , 2007 .

[14]  Constantinos Maglaras,et al.  Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations , 2003, Manag. Sci..

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

[16]  Prateek Kalia,et al.  Internet Marketing and B2c E-Commerce: The Indian Scenario , 2015 .

[17]  A. Odlyzko Network Neutrality, Search Neutrality, and the Never-Ending Conflict between Efficiency and Fairness in Markets , 2008 .

[18]  Brian D. Ripley,et al.  Stochastic Simulation , 2005 .