Connecting Arrow’s Theorem, voting theory, and the Traveling Salesperson Problem
Connecting Arrow’s Theorem, voting theory, and the Traveling Salesperson Problem
Problems with majority voting over pairs as represented by Arrow’s Theorem and those of finding the lengths of closed paths as captured by the Traveling Salesperson Problem (TSP) appear to have nothing in common. In fact, they are connected. As shown, pairwise voting and a version of the TSP share …