Connecting Arrow's Theorem, voting theory, and the traveling salesperson problem

DOI10.1090/CONM/795/15969arXiv2204.13230MaRDI QIDQ6397663FDOQ6397663

Authors: Donald G. Saari 

Publication date: 27 April 2022

Abstract: Problems with majority voting over pairs as represented by Arrow's Theoremand 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 the same domain where each system can be simplified by restricting it to complementary regions to eliminate extraneous terms. Central for doing so is the Borda Count, where it is shown that its outcome most accurately refects the voter preferences.

Recommendations

• Unifying voting theory from Nakamura's to Greenberg's theorems
• Mathematical structure of voting paradoxes. I: Pairwise votes
• The mathematics of voting
• Closed paths in graphs vs. voting theory
• Mathematics and voting

Mathematics Subject Classification ID

Applications of graph theory (05C90) Social choice (91B14) Voting theory (91B12)

Cited In (1)

• Closed paths in graphs vs. voting theory

This page was built for publication: Connecting Arrow's Theorem, voting theory, and the traveling salesperson problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397663)