The DOI matches its Crossref record.
Unveiling User Satisfaction and Creator Productivity Trade-Offs in Recommendation Platforms
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“But maximizing for immediate user engagement (Immorlica et al. 2024), as a quarterly economic imperative facing the platform's shareholders, can lead to less new content being created and even less longer-term user engagement - even if potentially at the expense of diminished immediate user satisfaction (Meta 2021; Yao et al. 2024).”
From "Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data (2025) · cites this paper as Yao et al. 2024
In the citing paper
“Recent research suggests that incorporating mechanisms to surface underrepresented ('longer-tail') content (C. Anderson 2012) could enhance overall platform performance without necessarily sacrificing user satisfaction (Houtti et al. 2024; Yao et al. 2024).”
From "Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data (2025) · cites this paper as Yao et al. 2024
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 52
- Arpit Agarwal and William Brown. Online recommendations for agents with discounted adaptive preferences. arXiv preprint arXiv:2302.06014, 2023. · arXiv
- Omer Ben-Porat and Moshe Tennenholtz. Shapley facility location games. In International Conference on Web and Internet Economics, pages 58-73. Springer, 2017.
- Omer Ben-Porat and Moshe Tennenholtz. A game-theoretic approach to recommendation systems with strategic content providers. Advances in Neural Information Processing Systems, 31, 2018.
- Erdem Biyik, Fan Yao, Yinlam Chow, Alex Haig, Chih-wei Hsu, Mohammad Ghavamzadeh, and Craig Boutilier. Preference elicitation with soft attributes in interactive recommen- dation. arXiv preprint arXiv:2311.02085, 2023. · arXiv
- Kianté Brantley, Zhichong Fang, Sarah Dean, and Thorsten Joachims. Ranking with long- term constraints. In Proceedings of the 17th ACM International Conference on Web Search and Data Mining, pages 47-56, 2024.
- Mario Bravo, David Leslie, and Panayotis Mertikopoulos. Bandit learning in concave n- person games. Advances in Neural Information Processing Systems, 31, 2018.
- Yang Cai and Weiqiang Zheng. Doubly optimal no-regret learning in monotone games. In International Conference on Machine Learning, pages 3507-3524. PMLR, 2023.
- Micah Carroll, Dylan Hadfield-Menell, Stuart Russell, and Anca Dragan. Estimating and penalizing preference shift in recommender systems. In Proceedings of the 15th ACM Conference on Recommender Systems, pages 661-667, 2021.
- Sarah H Cen, Andrew Ilyas, and Aleksander Madry. User strategization and trustworthy algorithms. arXiv preprint arXiv:2312.17666, 2023. · arXiv
- Sarah H Cen, Andrew Ilyas, Jennifer Allen, Hannah Li, and Aleksander Madry. Measuring strategization in recommendation: Users adapt their behavior to shape future content. arXiv preprint arXiv:2405.05596, 2024. · arXiv
- Constantinos Daskalakis, Paul W Goldberg, and Christos H Papadimitriou. The complexity of computing a nash equilibrium. SIAM Journal on Computing, 39(1):195-259, 2009.
- Sarah Dean and Jamie Morgenstern. Preference dynamics under personalized recommen- dations. In Proceedings of the 23rd ACM Conference on Economics and Computation, pages 795-816, 2022.
- Sarah Dean, Evan Dong, Meena Jagadeesan, and Liu Leqi. Recommender systems as dynamical systems: Interactions with viewers and creators. In Workshop on Recommen- dation Ecosystems: Modeling, Optimization and Incentive Design, 2024.
- Gerard Debreu. A social equilibrium existence theorem. Proceedings of the National Academy of Sciences, 38(10):886-893, 1952.
- Itay Eilat and Nir Rosenfeld. Performative recommendation: diversifying content via strategic incentives. In International Conference on Machine Learning, pages 9082-9103.
- PMLR, 2023.
- Christian Ewerhart. The lottery contest is a best-response potential game. Eco- nomics Letters, 155:168-171, 2017. ISSN 0165-1765. doi: https://doi.org/10.1016/ j.econlet.2017.03.030. URL https://www.sciencedirect.com/science/article/pii/ S0165176517301325. · DOI
- Ky Fan. Fixed-point and minimax theorems in locally convex topological linear spaces. Proceedings of the National Academy of Sciences, 38(2):121-126, 1952.
- Arpita Ghosh and Patrick Hummel. Learning and incentives in user-generated content: Multi-armed bandits with endogenous arms. In Proceedings of the 4th conference on Innovations in Theoretical Computer Science, pages 233-246, 2013.
- Arpita Ghosh and Preston McAfee. Incentivizing high-quality user-generated content. In Proceedings of the 20th international conference on World wide web, pages 137-146, 2011.
- Irving L Glicksberg. A further generalization of the kakutani fixed theorem, with application to nash equilibrium points. Proceedings of the American Mathematical Society, 3(1):170- 174, 1952.
- F Maxwell Harper and Joseph A Konstan. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis), 5(4):1-19, 2015.
- Thomas Hodgson. Spotify and the democratisation of music. Popular Music, 40(1):1-17, 2021.
- Jiri Hron, Karl Krauth, Michael I Jordan, Niki Kilbertus, and Sarah Dean. Modeling con- tent creator incentives on algorithm-curated platforms. arXiv preprint arXiv:2206.13102, 2022. · arXiv
- Qinlu Hu, Ni Huang, and Renyu Philip Zhang. Viewer traffic allocation for small creator development: Experimental evidence from short-video platforms. Available at SSRN 4888995, 2024.
- Xinyan Hu, Meena Jagadeesan, Michael I Jordan, and Jacob Steinhard. Incentivizing high- quality content in online recommender systems. arXiv preprint arXiv:2306.07479, 2023. · arXiv
- Nicole Immorlica, Meena Jagadeesan, and Brendan Lucier. Clickbait vs. quality: How engagement-based optimization shapes the content landscape in online platforms. In Proceedings of the ACM on Web Conference 2024, pages 36-45, 2024.
- Meena Jagadeesan, Nikhil Garg, and Jacob Steinhardt. Supply-side equilibria in recom- mender systems. Advances in Neural Information Processing Systems, 36, 2024.
- Dimitris Kalimeris, Smriti Bhagat, Shankar Kalyanaraman, and Udi Weinsberg. Prefer- ence amplification in recommender systems. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pages 805-815, 2021.
- Yehuda Koren, Robert Bell, and Chris Volinsky. Matrix factorization techniques for recom- mender systems. Computer, 42(8):30-37, 2009.
- Steven George Krantz and Harold R Parks. The implicit function theorem: history, theory, and applications. Springer Science & Business Media, 2002.
- Tao Lin, Kun Jin, Andrew Estornell, Xiaoying Zhang, Yiling Chen, and Yang Liu. User- creator feature dynamics in recommender systems with dual influence. arXiv preprint arXiv:2407.14094, 2024. · arXiv
- Martin Mladenov, Elliot Creager, Omer Ben-Porat, Kevin Swersky, Richard Zemel, and Craig Boutilier. Optimizing long-term social welfare in recommender systems: A con- strained matching approach. In International Conference on Machine Learning, pages 6987-6998. PMLR, 2020.
- John F Nash Jr. Equilibrium points in n-person games. Proceedings of the national academy of sciences, 36(1):48-49, 1950.
- Thành Nguyen and Milan Vojnovic. Weighted proportional allocation. ACM SIGMETRICS Performance Evaluation Review, 39(1):133-144, 2011.
- J David Pérez-Castrillo and Thierry Verdier. A general analysis of rent-seeking games. Public choice, 73(3):335-350, 1992.
- Siddharth Prasad, Martin Mladenov, and Craig Boutilier. Content prompting: Modeling content provider dynamics to improve user welfare in recommender ecosystems. arXiv preprint arXiv:2309.00940, 2023. · arXiv
- J Ben Rosen. Existence and uniqueness of equilibrium points for concave n-person games. Econometrica: Journal of the Econometric Society, pages 520-534, 1965.
- Marcelo Luis Barbosa dos Santos. The "so-called" ugc: an updated definition of user- generated content in the age of social media. Online Information Review, 46(1):95-113, 2022.
- Tatiana Tatarenko and Maryam Kamgarpour. Bandit learning in convex non-strictly mono- tone games. arXiv preprint arXiv:2009.04258, 2020. · arXiv
- Gordon Tullock. Efficient rent seeking. In Toward a theory of the rent-seeking society. College Station, TX: Texas A&M University Press, 1980.
- Renzhe Xu, Haotian Wang, Xingxuan Zhang, Bo Li, and Peng Cui. Ppa-game: Character- izing and learning competitive dynamics among online content creators. arXiv preprint arXiv:2403.15524, 2024. · arXiv
- Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, and Haifeng Xu. Learning from a learning user for optimal recommendations. In International Conference on Machine Learning, pages 25382-25406.
- PMLR, 2022a.
- Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, and Haifeng Xu. Learning the optimal recommendation from explorative users. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 9457-9465, 2022b.
- Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, and Haifeng Xu. How bad is top-k recommendation under competing content creators? In International Conference on Machine Learning. PMLR, 2023.
- Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, and Haifeng Xu. Human vs. generative ai in content creation competition: Symbiosis or conflict? In International Conference on Machine Learning. PMLR, 2024a.
- Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman, Yiming Liao, Yan Zhu, Qifan Wang, Hongning Wang, and Haifeng Xu. Rethinking incentives in recommender systems: Are monotone rewards always beneficial? Advances in Neural Information Processing Sys- tems, 36, 2024b.
- Fan Yao, Yiming Liao, Mingzhe Wu, Chuanhao Li, Yan Zhu, James Yang, Jingzhou Liu, Qifan Wang, Haifeng Xu, and Hongning Wang. User welfare optimization in recommender systems with competing content creators. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 3874-3885, 2024c.
- Zhiyu Zeng, Zhiqi Zhang, Dennis Zhang, and Tat Chan. The impact of recommender systems on content consumption and production: Evidence from field experiments and structural modeling. Available at SSRN, 2024.
- Banghua Zhu, Sai Praneeth Karimireddy, Jiantao Jiao, and Michael I Jordan. Online learning in a creator economy. arXiv preprint arXiv:2305.11381, 2023. · arXiv
- Wei Zhuang, Qingfeng Zeng, Yu Zhang, Chunmei Liu, and Weiguo Fan. What makes user-generated content more helpful on social media platforms? insights from creator interactivity perspective. Information processing & management, 60(2):103201, 2023.
Cited by
Sorted by citations
"Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data
Strauss, I., Yang, J., & Mazzucato, M. (2025) · arXiv
Metadata
- Authors
- Yao, F., Liao, Y., Liu, J., Nie, S., Wang, Q., Xu, H., & Wang, H.
- Venue
- Advances in Neural Information Processing Systems 37
- Published
- 2024
- Pages
- 86958-86984
- Cited by
- 5
- References
- 0
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review