A number of voting systems for multicandidate elections stipulate that the voter may, under certain constraints, cast v i ≥ 0 votes for the i-th candidate, i = 1,..., K (where K is the number of candidates), and that the candidate receiving the greatest total vote wins. We will refer to these methods as numerical voting systems. Each can be characterized by the constraints imposed: e.g., simple plurality voting permits one of the vi to be 1 but the others must be 0; approval voting permits each of the v i to be either 0 or 1; the Borda system requires that the set |v i : i = 1,..., K} consist of the numbers K-1, K-2, ..., 0; cardinal measure voting requires that 0 ≤ v i ≤ M for some fixed positive number M. For background on these and other multicandidate voting systems, see Black [1958], Brams [1978], Merrill [1980], and Weber [1978].
[1]
Jerome H. Black,et al.
The Multicandidate Calculus of Voting: Application to Canadian Federal Elections
,
1978
.
[2]
D. Black.
The theory of committees and elections
,
1959
.
[3]
Samuel Merrill,et al.
Strategic decisions under one-stage multi-candidate voting systems
,
1981
.
[4]
Bruce E. Cain,et al.
Strategic voting in Britain
,
1978
.
[5]
Steven J. Brams,et al.
The Presidential Election Game
,
1978
.
[6]
Howard Raiffa,et al.
Games And Decisions
,
1958
.
[7]
Samuel Merrill,et al.
Approval Voting: A ‘Best Buy’ Method for Multi-candidate Elections?
,
1979
.