An efficient algorithm for voting sequences

Susan H. Gensemer, Jerry S. Kelly

Research output: Contribution to journalArticlepeer-review


The chaos theorems show that given almost any alternatives x and y, there exists voting sequence from x to y. However, proofs of such results have been purely existential; that is, there is no algorithm by which such a voting path can be constructed. In this paper, we present such an algorithm for one standard example. Furthermore, it is shown that the algorithm has the property that the voting sequence involves the fewest possible number of steps.

Original languageEnglish (US)
Pages (from-to)59-75
Number of pages17
JournalMathematical social sciences
Issue number1
StatePublished - Aug 1987


  • chaos
  • majority voting
  • voting cycles

ASJC Scopus subject areas

  • Sociology and Political Science
  • General Social Sciences
  • General Psychology
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'An efficient algorithm for voting sequences'. Together they form a unique fingerprint.

Cite this