M

mathematics-of-voting

Project information

Research paper and codebase exploring the mathematical connection between social choice theory and modern ranking algorithms. We formally analyze Arrow's impossibility theorem and Condorcet's paradox, then demonstrate that the PageRank algorithm — modeled as a Markov chain — resolves classical voting paradoxes that no traditional electoral system can. Includes an interactive voting simulator and two independent mathematical experiments. SCSS ETTI UPB 2026.

python streamlit voting-theory mathematics condorcet markov-chains pagerank

6 Commits
1 Branch
0 Tags

README

Created on

May 17, 2026

Loading