Some properties of paths in the dynamic voting problem (Q1085022)
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: Some properties of paths in the dynamic voting problem |
scientific article; zbMATH DE number 3980838
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some properties of paths in the dynamic voting problem |
scientific article; zbMATH DE number 3980838 |
Statements
Some properties of paths in the dynamic voting problem (English)
0 references
1986
0 references
McKelvey's theorem [see \textit{M. A. Aizerman}, Autom. Remote Control 42, No.12, 1664-1675 (1982; Zbl 0513.90004)] is generalized to the case when voting in the ELECTIONS game is by the ''k-majority'' rule. Depending on the number of voters and the dimension of the program space, we determine the values of k for which the paths approach a certain region in this space.
0 references
k-majority rule
0 references
dynamic voting problem
0 references
