User Altruism in Recommendation Systems

• URL: http://arxiv.org/abs/2506.04525v2
• Date: Fri, 06 Jun 2025 17:19:41 GMT
• Title: User Altruism in Recommendation Systems
• Authors: Ekaterina Fedorova, Madeline Kitch, Chara Podimata,
• Abstract summary: Users of social media platforms based on recommendation systems (RecSys) strategically interact with platform content to influence future recommendations.<n>On some such platforms, users have been documented to form large-scale grassroots movements encouraging others to interact with algorithmically suppressed content in order to "boost" its recommendation.<n>We study a game between users and a RecSys, where users provide the RecSys (potentially manipulated) preferences over the contents available to them.<n>We show that our results are robust to several model misspecifications, thus strengthening our conclusions.
• Score: 3.8506666685467343
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Users of social media platforms based on recommendation systems (RecSys) (e.g. TikTok, X, YouTube) strategically interact with platform content to influence future recommendations. On some such platforms, users have been documented to form large-scale grassroots movements encouraging others to purposefully interact with algorithmically suppressed content in order to "boost" its recommendation; we term this behavior user altruism. To capture this behavior, we study a game between users and a RecSys, where users provide the RecSys (potentially manipulated) preferences over the contents available to them, and the RecSys -- limited by data and computation constraints -- creates a low-rank approximation preference matrix, and ultimately provides each user her (approximately) most-preferred item. We compare the users' social welfare under truthful preference reporting and under a class of strategies capturing user altruism. In our theoretical analysis, we provide sufficient conditions to ensure strict increases in user social welfare under user altruism, and provide an algorithm to find an effective altruistic strategy. Interestingly, we show that for commonly assumed recommender utility functions, effectively altruistic strategies also improve the utility of the RecSys! We show that our results are robust to several model misspecifications, thus strengthening our conclusions. Our theoretical analysis is complemented by empirical results of effective altruistic strategies on the GoodReads dataset, and an online survey on how real-world users behave altruistically in RecSys. Overall, our findings serve as a proof-of-concept of the reasons why traditional RecSys may incentivize users to form collectives and/or follow altruistic strategies when interacting with them.

Related papers

• RecGPT Technical Report [57.84251629878726]
  We propose RecGPT, a next-generation framework that places user intent at the center of the recommendation pipeline.<n> RecGPT integrates large language models into key stages of user interest mining, item retrieval, and explanation generation.<n>Online experiments demonstrate that RecGPT achieves consistent performance gains across stakeholders.
  arXiv  Detail & Related papers  (2025-07-30T17:55:06Z)
• Why am I seeing this? Towards recognizing social media recommender systems with missing recommendations [4.242821809663174]
  We introduce a method for Automatic Recommender Recognition using Graph Neural Networks (GNNs)<n>Our approach enables accurate detection of hidden recommenders and their influence on user behavior.<n>This study provides insights into how recommenders shape behavior, aiding efforts to reduce polarization and misinformation.
  arXiv  Detail & Related papers  (2025-04-15T09:16:17Z)
• Quantifying User Coherence: A Unified Framework for Cross-Domain Recommendation Analysis [69.37718774071793]
  This paper introduces novel information-theoretic measures for understanding recommender systems. We evaluate 7 recommendation algorithms across 9 datasets, revealing the relationships between our measures and standard performance metrics.
  arXiv  Detail & Related papers  (2024-10-03T13:02:07Z)
• Measuring Strategization in Recommendation: Users Adapt Their Behavior to Shape Future Content [66.71102704873185]
  We test for user strategization by conducting a lab experiment and survey. We find strong evidence of strategization across outcome metrics, including participants' dwell time and use of "likes" Our findings suggest that platforms cannot ignore the effect of their algorithms on user behavior.
  arXiv  Detail & Related papers  (2024-05-09T07:36:08Z)
• User Welfare Optimization in Recommender Systems with Competing Content Creators [65.25721571688369]
  In this study, we perform system-side user welfare optimization under a competitive game setting among content creators. We propose an algorithmic solution for the platform, which dynamically computes a sequence of weights for each user based on their satisfaction of the recommended content. These weights are then utilized to design mechanisms that adjust the recommendation policy or the post-recommendation rewards, thereby influencing creators' content production strategies.
  arXiv  Detail & Related papers  (2024-04-28T21:09:52Z)
• Beyond Trial-and-Error: Predicting User Abandonment After a Moderation Intervention [0.6918368994425961]
  Current content moderation follows a reactive, trial-and-error approach.<n>We introduce a proactive, predictive approach that enables moderators to anticipate the impact of their actions before implementation.<n>We study the reactions of 16,540 users to a massive ban of online communities on Reddit.
  arXiv  Detail & Related papers  (2024-04-23T08:52:41Z)
• Decoding the Silent Majority: Inducing Belief Augmented Social Graph with Large Language Model for Response Forecasting [74.68371461260946]
  SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics. Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
  arXiv  Detail & Related papers  (2023-10-20T06:17:02Z)
• How Bad is Top-$K$ Recommendation under Competing Content Creators? [43.2268992294178]
  We study the user welfare guarantee through the lens of Price of Anarchy. We show that the fraction of user welfare loss due to creator competition is always upper bounded by a small constant depending on $K$ and randomness in user decisions.
  arXiv  Detail & Related papers  (2023-02-03T19:37:35Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• Generalized Strategic Classification and the Case of Aligned Incentives [16.607142366834015]
  We argue for a broader perspective on what accounts for strategic user behavior. Our model subsumes most current models, but includes other novel settings. We show how our results and approach can extend to the most general case.
  arXiv  Detail & Related papers  (2022-02-09T09:36:09Z)
• Empowering Active Learning to Jointly Optimize System and User Demands [70.66168547821019]
  We propose a new active learning approach that jointly optimize the active learning system (training efficiently) and the user (receiving useful instances) We study our approach in an educational application, which particularly benefits from this technique as the system needs to rapidly learn to predict the appropriateness of an exercise to a particular user. We evaluate multiple learning strategies and user types with data from real users and find that our joint approach better satisfies both objectives when alternative methods lead to many unsuitable exercises for end users.
  arXiv  Detail & Related papers  (2020-05-09T16:02:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.