An Offer you Cannot Refuse? Trends in the Coerciveness of Amazon Book
Recommendations
- URL: http://arxiv.org/abs/2310.14060v1
- Date: Sat, 21 Oct 2023 16:32:38 GMT
- Title: An Offer you Cannot Refuse? Trends in the Coerciveness of Amazon Book
Recommendations
- Authors: Jonathan H. Rystr{\o}m
- Abstract summary: We use textitBarrier-to-Exit, a metric for how difficult it is for users to change preferences, to analyse a large dataset of Amazon Book Ratings from 1998 to 2018.
Our findings indicate a highly significant growth of Barrier-to-Exit over time, suggesting that it has become more difficult for the analysed subset of users to change their preferences.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recommender systems can be a helpful tool for recommending content but they
can also influence users' preferences. One sociological theory for this
influence is that companies are incentivised to influence preferences to make
users easier to predict and thus more profitable by making it harder to change
preferences. This paper seeks to test that theory empirically. We use
\textit{Barrier-to-Exit}, a metric for how difficult it is for users to change
preferences, to analyse a large dataset of Amazon Book Ratings from 1998 to
2018. We focus the analysis on users who have changed preferences according to
Barrier-to-Exit. To assess the growth of Barrier-to-Exit over time, we
developed a linear mixed-effects model with crossed random effects for users
and categories. Our findings indicate a highly significant growth of
Barrier-to-Exit over time, suggesting that it has become more difficult for the
analysed subset of users to change their preferences. However, it should be
noted that these findings come with several statistical and methodological
caveats including sample bias and construct validity issues related to
Barrier-to-Exit. We discuss the strengths and limitations of our approach and
its implications. Additionally, we highlight the challenges of creating
context-sensitive and generalisable measures for complex socio-technical
concepts such as "difficulty to change preferences." We conclude with a call
for further research: to curb the potential threats of preference manipulation,
we need more measures that allow us to compare commercial as well as
non-commercial systems.
Related papers
- 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) - The Impact of Recommendation Systems on Opinion Dynamics: Microscopic
versus Macroscopic Effects [1.4180331276028664]
We study the impact of recommendation systems on users, both from a microscopic (i.e., at the level of individual users) and a macroscopic perspective.
Our analysis reveals that shifts in the opinions of individual users do not always align with shifts in the opinion distribution of the population.
arXiv Detail & Related papers (2023-09-16T11:44:51Z) - Pacos: Modeling Users' Interpretable and Context-Dependent Choices in
Preference Reversals [8.041047797530808]
We identify three factors contributing to context effects: users' adaptive weights, the inter-item comparison, and display positions.
We propose a context-dependent preference model named Pacos as a unified framework for addressing three factors simultaneously.
Experimental results show that the proposed method has better performance than prior works in predicting users' choices.
arXiv Detail & Related papers (2023-03-10T01:49:56Z) - Debiasing Recommendation by Learning Identifiable Latent Confounders [49.16119112336605]
Confounding bias arises due to the presence of unmeasured variables that can affect both a user's exposure and feedback.
Existing methods either (1) make untenable assumptions about these unmeasured variables or (2) directly infer latent confounders from users' exposure.
We propose a novel method, i.e., identifiable deconfounder (iDCF), which leverages a set of proxy variables to resolve the aforementioned non-identification issue.
arXiv Detail & Related papers (2023-02-10T05:10:26Z) - 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) - Preference Dynamics Under Personalized Recommendations [12.89628003097857]
We show whether some phenomenon akin to polarization occurs when users receive personalized content recommendations.
A more interesting objective is to understand under what conditions a recommendation algorithm can ensure stationarity of user's preferences.
arXiv Detail & Related papers (2022-05-25T19:29:53Z) - Price DOES Matter! Modeling Price and Interest Preferences in
Session-based Recommendation [55.0391061198924]
Session-based recommendation aims to predict items that an anonymous user would like to purchase based on her short behavior sequence.
It is nontrivial to incorporate price preferences for session-based recommendation.
We propose a novel method Co-guided Heterogeneous Hypergraph Network (CoHHN) for session-based recommendation.
arXiv Detail & Related papers (2022-05-09T10:47:15Z) - Joint Multisided Exposure Fairness for Recommendation [76.75990595228666]
This paper formalizes a family of exposure fairness metrics that model the problem jointly from the perspective of both the consumers and producers.
Specifically, we consider group attributes for both types of stakeholders to identify and mitigate fairness concerns that go beyond individual users and items towards more systemic biases in recommendation.
arXiv Detail & Related papers (2022-04-29T19:13:23Z) - Estimating and Penalizing Induced Preference Shifts in Recommender
Systems [10.052697877248601]
We argue that system designers should: estimate the shifts a recommender would induce; evaluate whether such shifts would be undesirable; and even actively optimize to avoid problematic shifts.
We do this by using historical user interaction data to train predictive user model which implicitly contains their preference dynamics.
In simulated experiments, we show that our learned preference dynamics model is effective in estimating user preferences and how they would respond to new recommenders.
arXiv Detail & Related papers (2022-04-25T21:04:46Z) - Diverse Preference Augmentation with Multiple Domains for Cold-start
Recommendations [92.47380209981348]
We propose a Diverse Preference Augmentation framework with multiple source domains based on meta-learning.
We generate diverse ratings in a new domain of interest to handle overfitting on the case of sparse interactions.
These ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability.
arXiv Detail & Related papers (2022-04-01T10:10:50Z) - Identifying Influential Users in Unknown Social Networks for Adaptive
Incentive Allocation Under Budget Restriction [24.793013471521924]
Incentivization has been proven to be a more proactive way to affect users' behaviors.
We propose a novel algorithm for exploring influential users in unknown networks.
We design an adaptive incentive allocation approach that determines incentive values based on users' preferences and their influence ability.
arXiv Detail & Related papers (2021-07-13T11:20:10Z)
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.