Algorithmic bias amplifies opinion polarization: A bounded confidence model
March 06, 2018 ยท Declared Dead ยท ๐ PLoS ONE
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Alina Sรฎrbu, Dino Pedreschi, Fosca Giannotti, Jรกnos Kertรฉsz
arXiv ID
1803.02111
Category
physics.soc-ph
Cross-listed
cs.MA,
cs.SI
Citations
92
Venue
PLoS ONE
Last Checked
2 months ago
Abstract
The flow of information reaching us via the online media platforms is optimized not by the information content or relevance but by popularity and proximity to the target. This is typically performed in order to maximise platform usage. As a side effect, this introduces an algorithmic bias that is believed to enhance polarization of the societal debate. To study this phenomenon, we modify the well-known continuous opinion dynamics model of bounded confidence in order to account for the algorithmic bias and investigate its consequences. In the simplest version of the original model the pairs of discussion participants are chosen at random and their opinions get closer to each other if they are within a fixed tolerance level. We modify the selection rule of the discussion partners: there is an enhanced probability to choose individuals whose opinions are already close to each other, thus mimicking the behavior of online media which suggest interaction with similar peers. As a result we observe: a) an increased tendency towards polarization, which emerges also in conditions where the original model would predict convergence, and b) a dramatic slowing down of the speed at which the convergence at the asymptotic state is reached, which makes the system highly unstable. Polarization is augmented by a fragmented initial population.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ physics.soc-ph
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
๐ป
Ghosted
Statistical physics of human cooperation
R.I.P.
๐ป
Ghosted
Vital nodes identification in complex networks
R.I.P.
๐ป
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
๐ป
Ghosted
Scale-free networks are rare
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted