Vulnerability of democratic electoral systems
August 19, 2023 Β· Declared Dead Β· π IEEE Transactions on Computational Social Systems
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Tomasz Raducha, JarosΕaw Klamut, Roger Cremades, Paul Bouman, Mateusz WiliΕski
arXiv ID
2308.10066
Category
physics.soc-ph
Cross-listed
cs.SI
Citations
1
Venue
IEEE Transactions on Computational Social Systems
Last Checked
4 months ago
Abstract
The two most common types of electoral systems (ES) used in electing national legislatures are proportional representation and plurality voting. When they are evaluated, most often the arguments come from social choice theory and political sciences. The former overall uses an axiomatic approach including a list of mathematical criteria a system should fulfill. The latter predominantly focuses on the trade-off between proportionality of apportionment and governability. However, there is no consensus on the best ES, nor on the set of indexes and measures that would be the most important in such assessment. Moreover, the ongoing debate about the fairness of national elections neglects the study of their vulnerabilities. Here we address this research gap with a framework that can measure electoral systems' vulnerability to different means of influence. Using in silico analysis we show that plurality voting systems are less stable than proportional representation. They are also more susceptible to political agitators and media propaganda. A review of real-world ES reveals possible improvements in their design leading to lower susceptibility. Additionally, our simulation framework allows computation of popular indexes, as the Gallagher index or the effective number of parties, in different scenarios. Our work provides a new tool for dealing with modern threats to democracy that could destabilize voting processes. Furthermore, our results add an important argument in a long-standing discussion on evaluation of ES.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
π
π
The Cartographer
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
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted