M

markov-chains

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.