Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists

• URL: http://arxiv.org/abs/2404.04269v1
• Date: Tue, 19 Mar 2024 23:27:15 GMT
• Title: Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists
• Authors: Joachim Baumann, Celestine Mendler-Dünner,
• Abstract summary: We investigate algorithmic collective action in transformer-based recommender systems. Our use case is a collective of fans aiming to promote the visibility of an artist by strategically placing one of their songs in the existing playlists they control. We introduce two easily implementable strategies towards this goal and test their efficacy on a publicly available recommender system model released by a major music streaming platform.
• Score: 10.681288493631978
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate algorithmic collective action in transformer-based recommender systems. Our use case is a collective of fans aiming to promote the visibility of an artist by strategically placing one of their songs in the existing playlists they control. The success of the collective is measured by the increase in test-time recommendations of the targeted song. We introduce two easily implementable strategies towards this goal and test their efficacy on a publicly available recommender system model released by a major music streaming platform. Our findings reveal that even small collectives (controlling less than 0.01% of the training data) can achieve up 25x amplification of recommendations by strategically choosing the position at which to insert the song. We then focus on investigating the externalities of the strategy. We find that the performance loss for the platform is negligible, and the recommendations of other songs are largely preserved, minimally impairing the user experience of participants. Moreover, the costs are evenly distributed among other artists. Taken together, our findings demonstrate how collective action strategies can be effective while not necessarily being adversarial, raising new questions around incentives, social dynamics, and equilibria in recommender systems.

Related papers

• Advancing Cultural Inclusivity: Optimizing Embedding Spaces for Balanced Music Recommendations [4.276697874428501]
  Popularity bias in music recommendation systems can propagate along demographic and cultural axes. We identify these biases in recommendations for artists from underrepresented cultural groups in prototype-based matrix factorization methods. Our results demonstrate significant improvements in reducing popularity bias and enhancing demographic and cultural fairness in music recommendations.
  arXiv  Detail & Related papers  (2024-05-27T19:12:53Z)
• 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)
• Fast Peer Adaptation with Context-aware Exploration [63.08444527039578]
  We propose a peer identification reward for learning agents in multi-agent games. This reward motivates the agent to learn a context-aware policy for effective exploration and fast adaptation. We evaluate our method on diverse testbeds that involve competitive (Kuhn Poker), cooperative (PO-Overcooked), or mixed (Predator-Prey-W) games with peer agents.
  arXiv  Detail & Related papers  (2024-02-04T13:02:27Z)
• Fairness Through Domain Awareness: Mitigating Popularity Bias For Music Discovery [56.77435520571752]
  We explore the intrinsic relationship between music discovery and popularity bias. We propose a domain-aware, individual fairness-based approach which addresses popularity bias in graph neural network (GNNs) based recommender systems. Our approach uses individual fairness to reflect a ground truth listening experience, i.e., if two songs sound similar, this similarity should be reflected in their representations.
  arXiv  Detail & Related papers  (2023-08-28T14:12:25Z)
• Incentive-Aware Recommender Systems in Two-Sided Markets [49.692453629365204]
  We propose a novel recommender system that aligns with agents' incentives while achieving myopically optimal performance. Our framework models this incentive-aware system as a multi-agent bandit problem in two-sided markets. Both algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation.
  arXiv  Detail & Related papers  (2022-11-23T22:20:12Z)
• A Tale of HodgeRank and Spectral Method: Target Attack Against Rank Aggregation Is the Fixed Point of Adversarial Game [153.74942025516853]
  The intrinsic vulnerability of the rank aggregation methods is not well studied in the literature. In this paper, we focus on the purposeful adversary who desires to designate the aggregated results by modifying the pairwise data. The effectiveness of the suggested target attack strategies is demonstrated by a series of toy simulations and several real-world data experiments.
  arXiv  Detail & Related papers  (2022-09-13T05:59:02Z)
• Exploiting Negative Preference in Content-based Music Recommendation with Contrastive Learning [16.728976424372362]
  We analyze the role of negative preference in users' music tastes by comparing music recommendation models with contrastive learning exploiting preference (CLEP) Our experimental results show that CLEP-N outperforms the other two in accuracy and false positive rate.
  arXiv  Detail & Related papers  (2022-07-28T07:02:48Z)
• A session-based song recommendation approach involving user characterization along the play power-law distribution [0.0]
  This work is focused on two important issues that have not received much attention: managing gray-sheep users and obtaining implicit ratings. The first one is usually addressed by resorting to content information that is often difficult to obtain. The other drawback is related to the sparsity problem that arises when there are obstacles to gather explicit ratings.
  arXiv  Detail & Related papers  (2020-04-25T07:17:03Z)
• Incentivizing Exploration with Selective Data Disclosure [94.32975679779491]
  We propose and design recommendation systems that incentivize efficient exploration. Agents arrive sequentially, choose actions and receive rewards, drawn from fixed but unknown action-specific distributions. We attain optimal regret rate for exploration using a flexible frequentist behavioral model.
  arXiv  Detail & Related papers  (2018-11-14T19:29:16Z)

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.