Modeling Content Creator Incentives on Algorithm-Curated Platforms

Content creators compete for user attention. Their reach crucially depends on algorithmic choices made by developers on online platforms. To maximize exposure, many creators adapt strategically, as evidenced by examples like the sprawling search engine optimization industry. This begets competition for the finite user attention pool. We formalize these dynamics in what we call an exposure game , a model of incentives induced by algorithms including modern factorization and (deep) two-tower architectures. We prove that seemingly innocuous algorithmic choices—e.g., non-negative vs. unconstrained factorization—significantly affect the existence and character of (Nash) equilibria in exposure games. We proffer use of creator behavior models like ours for an (ex-ante) pre-deployment audit . Such an audit can identify misalignment between desirable and incentivized content, and thus complement post-hoc measures like content filtering and moderation. To this end, we propose tools for numerically finding equilibria in exposure games, and illustrate results of an audit on the MovieLens and LastFM datasets. Among else, we find that the strategically produced content exhibits strong dependence between algorithmic exploration and content diversity, and between model expressivity and bias towards gender-based user and creator groups.

[1]  J. Steinhardt,et al.  Supply-Side Equilibria in Recommender Systems , 2022, ArXiv.

[2]  Galit Shmueli,et al.  Barriers to academic data science research in the new realm of algorithmic behaviour modification by digital platforms , 2022, Nature Machine Intelligence.

[3]  Zubair Shafiq,et al.  YouTube, The Great Radicalizer? Auditing and Mitigating Ideological Biases in YouTube Recommendations , 2022, ArXiv.

[4]  Julian A. Rodriguez LGBTQ Incorporated: YouTube and the Management of Diversity , 2022, Journal of homosexuality.

[5]  Lydia T. Liu,et al.  Strategic Ranking , 2021, AISTATS.

[6]  Jamal Atif,et al.  Online certification of preference-based fairness for personalized recommender systems , 2021, AAAI.

[7]  Luca Belli,et al.  Algorithmic amplification of politics on Twitter , 2021, Proceedings of the National Academy of Sciences.

[8]  Arvind Narayanan,et al.  T-RECS: A Simulation Tool to Study the Societal Impact of Recommender Systems , 2021, ArXiv.

[9]  Benjamin Recht,et al.  Quantifying Availability and Discovery in Recommender Systems via Stochastic Reachability , 2021, ICML.

[10]  Celestine Mendler-Dünner,et al.  Alternative Microfoundations for Strategic Classification , 2021, ICML.

[11]  Preetam Nandy,et al.  A/B Testing for Recommender Systems in a Two-sided Marketplace , 2021, NeurIPS.

[12]  Konstantina Christakopoulou,et al.  Towards Content Provider Aware Recommender Systems: A Simulation Study on the Interplay between User and Provider Utilities , 2021, WWW.

[13]  Akshita Patil,et al.  Comparative Study Of Google Search Engine Optimization Algorithms: Panda, Penguin and Hummingbird , 2021, 2021 6th International Conference for Convergence in Technology (I2CT).

[14]  Jessie J. Smith,et al.  Fairness and Transparency in Recommendation: The Users’ Perspective , 2021, UMAP.

[15]  Ed H. Chi,et al.  Practical Compositional Fairness: Understanding Fairness in Multi-Component Recommender Systems , 2021, WSDM.

[16]  Devavrat Shah,et al.  Regulating algorithmic filtering on social media , 2020, NeurIPS.

[17]  Bernhard Rieder,et al.  Towards platform observability , 2020, Internet Policy Rev..

[18]  Michael I. Jordan,et al.  Do Offline Metrics Predict Online Performance in Recommender Systems? , 2020, ArXiv.

[19]  M. Velasquez,et al.  Ethics of the Attention Economy: The Problem of Social Media Addiction , 2020, Business Ethics Quarterly.

[20]  C. Castillo,et al.  Exploring Artist Gender Bias in Music Recommendation , 2020, ComplexRec-ImpactRS@RecSys.

[21]  Nicolas Hug,et al.  Surprise: A Python library for recommender systems , 2020, J. Open Source Softw..

[22]  Viet Ha-Thuc,et al.  A Counterfactual Framework for Seller-Side A/B Testing on Marketplaces , 2020, SIGIR.

[23]  Craig Boutilier,et al.  Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approach , 2020, ICML.

[24]  Csaba Szepesvari,et al.  Bandit Algorithms , 2020 .

[25]  Jaime Fern'andez del R'io,et al.  Array programming with NumPy , 2020, Nature.

[26]  Nazri Mohd Nawi,et al.  The new trend for search engine optimization, tools and techniques , 2020 .

[27]  Mariarosaria Taddeo,et al.  Recommender systems and their ethical challenges , 2020, AI & SOCIETY.

[28]  Celestine Mendler-Dünner,et al.  Performative Prediction , 2020, ICML.

[29]  Adam Tauman Kalai,et al.  The disparate equilibria of algorithmic decision making when individuals invest rationally , 2019, FAT*.

[30]  Moshe Tennenholtz,et al.  Content Provider Dynamics and Coordination in Recommendation Ecosystems , 2020, NeurIPS.

[31]  Li Wei,et al.  Sampling-bias-corrected neural modeling for large corpus item recommendations , 2019, RecSys.

[32]  Ed H. Chi,et al.  Fairness in Recommendation Ranking through Pairwise Comparisons , 2019, KDD.

[33]  S. Shankar Sastry,et al.  On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games , 2019, 1901.00838.

[34]  Ed H. Chi,et al.  Top-K Off-Policy Correction for a REINFORCE Recommender System , 2018, WSDM.

[35]  Brett R. Gordon,et al.  A Comparison of Approaches to Advertising Measurement: Evidence from Big Field Experiments at Facebook , 2018, Mark. Sci..

[36]  Moshe Tennenholtz,et al.  From Recommendation Systems to Facility Location Games , 2018, AAAI.

[37]  Nicole Immorlica,et al.  The Disparate Effects of Strategic Manipulation , 2018, FAT.

[38]  Anca D. Dragan,et al.  The Social Cost of Strategic Classification , 2018, FAT.

[39]  Jon M. Kleinberg,et al.  How Do Classifiers Induce Agents to Invest Effort Strategically? , 2018, EC.

[40]  Moshe Tennenholtz,et al.  Convergence of Learning Dynamics in Information Retrieval Games , 2018, AAAI.

[41]  Moshe Tennenholtz,et al.  A Game-Theoretic Approach to Recommendation Systems with Strategic Content Providers , 2018, NeurIPS.

[42]  James Williams Stand Out of Our Light : Freedom and Resistance in the Attention Economy , 2018 .

[43]  Thore Graepel,et al.  The Mechanics of n-Player Differentiable Games , 2018, ICML.

[44]  Jacek M. Zurada,et al.  Deep Learning of Constrained Autoencoders for Enhanced Understanding of Data , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[45]  Moshe Tennenholtz,et al.  Information Retrieval Meets Game Theory: The Ranking Competition Between Documents' Authors , 2017, SIGIR.

[46]  Claudio Gentile,et al.  Boltzmann Exploration Done Right , 2017, NIPS.

[47]  Ran Ben Basat A Game Theoretic Analysis of the Adversarial Retrieval Setting , 2017 .

[48]  Paul Covington,et al.  Deep Neural Networks for YouTube Recommendations , 2016, RecSys.

[49]  Christos H. Papadimitriou,et al.  Strategic Classification , 2015, ITCS.

[50]  S. Shankar Sastry,et al.  On the Characterization of Local Nash Equilibria in Continuous Games , 2014, IEEE Transactions on Automatic Control.

[51]  et al.,et al.  Jupyter Notebooks - a publishing format for reproducible computational workflows , 2016, ELPUB.

[52]  F. Maxwell Harper,et al.  The MovieLens Datasets: History and Context , 2016, TIIS.

[53]  Anmol Bhasin,et al.  From Infrastructure to Culture: A/B Testing Challenges in Large Scale Social Networks , 2015, KDD.

[54]  Diane Tang,et al.  Focusing on the Long-term: It's Good for Users and Business , 2015, KDD.

[55]  Larry P. Heck,et al.  Learning deep structured semantic models for web search using clickthrough data , 2013, CIKM.

[56]  Santosh S. Vempala,et al.  Algorithms for implicit hitting set problems , 2011, SODA '11.

[57]  Thierry Bertin-Mahieux,et al.  The Million Song Dataset , 2011, ISMIR.

[58]  Ashish Agarwal,et al.  Overlapping experiment infrastructure: more, better, faster experimentation , 2010, KDD.

[59]  Wei Chu,et al.  A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.

[60]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[61]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

[62]  Nick Craswell,et al.  An experimental comparison of click position-bias models , 2008, WSDM '08.

[63]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[64]  John D. Hunter,et al.  Matplotlib: A 2D Graphics Environment , 2007, Computing in Science & Engineering.

[65]  D. Prelec,et al.  Contrast Effects in Consumer Judgments : Changes in Mental Representations or in the Anchoring of Rating Scales ? , 2007 .

[66]  M. Bena Learning Processes, Mixed Equilibria and Dynamical Systems Arising from Repeated Games , 2007 .

[67]  Rashmi R. Sinha,et al.  The role of transparency in recommender systems , 2002, CHI Extended Abstracts.

[68]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[69]  H. Young,et al.  Learning dynamics in games with stochastic perturbations , 1995 .

[70]  David M. Kreps,et al.  Learning Mixed Equilibria , 1993 .

[71]  Leo K. Simon,et al.  Games with Discontinuous Payoffs , 1987 .

[72]  Gerard Debreu,et al.  A Social Equilibrium Existence Theorem* , 1952, Proceedings of the National Academy of Sciences.

[73]  K. Fan Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces. , 1952, Proceedings of the National Academy of Sciences of the United States of America.

[74]  I. Glicksberg A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS , 1952 .

[75]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[76]  H. Hotelling Stability in Competition , 1929 .