corner
corner

Phys. Rev. Lett. 81, 1718–1721 (1998)

Statistical Mechanics of Voting

Download: PDF (118 kB) Buy this article Export: BibTeX or EndNote (RIS)

David A. Meyer1,2,* and Thad A. Brown1,3,†
1Center for Social Computation/Institute for Physical Sciences, Los Alamos, New Mexico
2Project in Geometry and Physics, Department of Mathematics, University of California/San Diego, La Jolla, California 92093-0112
3Department of Political Science, 113 Professional Building, University of Missouri/Columbia, Columbia, Missouri 65211

Received 20 March 1998; published in the issue dated 24 August 1998

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.

© 1998 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevLett.81.1718
DOI:
10.1103/PhysRevLett.81.1718
PACS:
05.20.-y, 01.75.+m, 05.45.+b, 89.90.+n

*Email address: dmeyer@chonji.ucsd.edu

Email address: polstab@showme.missouri.edu