A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem
Sergio Rajsbaum, Armajac Raventós-Pujol · 2022
Baryshnikov presented a remarkable algebraic topology proof of Arrow's impossibility theorem trying to understand the underlying reason behind the numerous proofs of this fundamental result of social choice theory. We present here a novel combinatorial topology approach that does not use advanced mathematics, while giving a geometric intuition of the impossibility. This exposes a remarkable connection with distributed computing techniques.