An efficient algorithm for voting sequences

Susan H. Gensemer; Jerry S. Kelly

doi:10.1016/0165-4896(87)90015-1

An efficient algorithm for voting sequences

Susan H. Gensemer, Jerry S. Kelly

Department of Economics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	59-75
Number of pages	17
Journal	Mathematical social sciences
Volume	14
Issue number	1
DOIs	https://doi.org/10.1016/0165-4896(87)90015-1
State	Published - Aug 1987

Keywords

chaos
majority voting
voting cycles

ASJC Scopus subject areas

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

Access to Document

10.1016/0165-4896(87)90015-1

Cite this

@article{37b3b3b907fd49b5ba12a2ab741bbd8e,

title = "An efficient algorithm for voting sequences",

abstract = "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.",

keywords = "chaos, majority voting, voting cycles",

author = "Gensemer, {Susan H.} and Kelly, {Jerry S.}",

year = "1987",

month = aug,

doi = "10.1016/0165-4896(87)90015-1",

language = "English (US)",

volume = "14",

pages = "59--75",

journal = "Mathematical social sciences",

issn = "0165-4896",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - An efficient algorithm for voting sequences

AU - Gensemer, Susan H.

AU - Kelly, Jerry S.

PY - 1987/8

Y1 - 1987/8

N2 - 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.

AB - 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.

KW - chaos

KW - majority voting

KW - voting cycles

UR - http://www.scopus.com/inward/record.url?scp=34247752517&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247752517&partnerID=8YFLogxK

U2 - 10.1016/0165-4896(87)90015-1

DO - 10.1016/0165-4896(87)90015-1

M3 - Article

AN - SCOPUS:34247752517

SN - 0165-4896

VL - 14

SP - 59

EP - 75

JO - Mathematical social sciences

JF - Mathematical social sciences

IS - 1

ER -

An efficient algorithm for voting sequences

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this