Statistical Mechanics of Voting
Authors:
- 24 August 1998
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 81 (8) , 1718-1721
Abstract
Decision procedures aggregating the preferences of multiple agents can produce cycles and hence outcomes which have been described heuristically as “chaotic.” We make this description precise by constructing an explicit dynamical system from the agents' preferences and a voting rule. The dynamics form a one-dimensional statistical mechanics model; this suggests the use of the topological entropy to quantify the complexity of the system. We compute the expected complexity of a voting rule and the degree of cohesion/diversity among agents using random matrix models—ensembles of statistical mechanics models—in some representative cases.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Living machinesRobotics and Autonomous Systems, 1995
- Unifying Impossibility Theorems: A Topological ApproachAdvances in Applied Mathematics, 1993
- The ultimate of chaos resulting from weighted voting systemsAdvances in Applied Mathematics, 1984
- The topological equivalence of the pareto condition and the existence of a dictatorJournal of Mathematical Economics, 1982
- Period Three Implies ChaosThe American Mathematical Monthly, 1975
- Topological entropyTransactions of the American Mathematical Society, 1965
- Intrinsic Markov chainsTransactions of the American Mathematical Society, 1964
- A Theorem on the Construction of Voting ParadoxesEconometrica, 1953
- On the Rationale of Group Decision-makingJournal of Political Economy, 1948
- A Paradox in the Scoring of Competing TeamsScience, 1938