Native Advertisement Selection and Allocation in Social Media Post Feeds

We study native advertisement selection and placement in social media post feeds. In the prevalent pay-per-click model, each ad click leads to certain amount of revenue for the platform. The probability of click for an ad depends on attributes that are either inherent to the ad e.g., ad quality or related to user profile and activity or related to the post feed. While the first two types of attributes are also encountered in web-search advertising, the third one fundamentally differentiates native from web-search advertising, and it is the one we model and study in this paper. Evidence from online platforms suggests that the main attributes of the third type that affect ad clicks are the relevance of ads to preceding posts, and the distance between consecutively projected ads; e.g., the fewer the intervening posts between ads, the smaller the click probability is, due to user saturation. We model the events of ad clicks as Bernoulli random variables. We seek the ad selection and allocation policy that optimizes a metric which is a combination of i the platform expected revenue, and ii uncertainty in revenue, captured by the variance of provisionally consumed budget of selected ads. Uncertainty in revenue should be minimum, since this translates into reduced profit or wasted advertising opportunities for the platform. On the other hand, the expected revenue from ad clicking should be maximum. The constraint is that the expected revenue attained for each selected ad should not exceed its apriori set budget. We show that the optimization problem above reduces to an instance of a resource-constrained minimum-cost path problem on a weighted directed acyclic graph. Through numerical evaluation, we assess the impact of various parameters on the objective, and the way they shape the tradeoff between revenue and uncertainty.

[1]  Ke Zhou,et al.  Predicting Pre-click Quality for Native Advertisements , 2016, WWW.

[2]  Aristides Gionis,et al.  Opinion Maximization in Social Networks , 2013, SDM.

[3]  Vahab S. Mirrokni,et al.  Optimal marketing strategies over social networks , 2008, WWW.

[4]  Peter A. Flach,et al.  Machine Learning - The Art and Science of Algorithms that Make Sense of Data , 2012 .

[5]  H. Varian Online Ad Auctions , 2009 .

[6]  Ishai Menache,et al.  Dynamic Online-Advertising Auctions as Stochastic Scheduling , 2009 .

[7]  Y. Narahari,et al.  Game Theoretic Problems in Network Economics and Mechanism Design Solutions , 2009, Advanced Information and Knowledge Processing.

[8]  Laks V. S. Lakshmanan,et al.  Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret , 2014, Proc. VLDB Endow..

[9]  Fabrizio Silvestri,et al.  Promoting Positive Post-Click Experience for In-Stream Yahoo Gemini Users , 2015, KDD.

[10]  Bal Azs Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[13]  Aditya Bhaskara,et al.  Optimizing Display Advertising in Online Social Networks , 2015, WWW.

[14]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[15]  Aranyak Mehta,et al.  Optimizing budget constrained spend in search advertising , 2013, WSDM '13.

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[17]  R. Srikant,et al.  Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits , 2015, NIPS.

[18]  Anand Rajaraman,et al.  Mining of Massive Datasets , 2011 .

[19]  Sachin Garg,et al.  Portfolio Allocation for Sellers in Online Advertising , 2015, ArXiv.

[20]  Din J. Wasem,et al.  Mining of Massive Datasets , 2014 .

[21]  Eric Bax,et al.  Pigovian Taxes Can Increase Platform Competitiveness: The Case of Online Display Advertising , 2014, ArXiv.

[22]  Asuman E. Ozdaglar,et al.  Optimal Pricing in the Presence of Local Network Effects , 2010, WINE.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Sergei Vassilvitskii,et al.  Advertising in a stream , 2014, WWW.

[25]  Janette Lehmann From site to inter-site user engagement : fundamentals and applications , 2015 .