An efficient algorithm for voting sequences (Q1101316)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for voting sequences |
scientific article; zbMATH DE number 4047378
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for voting sequences |
scientific article; zbMATH DE number 4047378 |
Statements
An efficient algorithm for voting sequences (English)
0 references
1987
0 references
The chaos theorems show that given almost any alternatives x and y, there exists a 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.
0 references
majority voting
0 references
voting cycles
0 references
chaos theorems
0 references
voting path
0 references
