Sequential voting by veto: Making the Mueller-Moulin algorithm more versatile
✍ Scribed by S. Felsenthal; Moshé Machover
- Book ID
- 104635146
- Publisher
- Springer US
- Year
- 1992
- Tongue
- English
- Weight
- 853 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0040-5833
No coin nor oath required. For personal study only.
✦ Synopsis
This paper shows that a relatively easy algorithm for computing the (unique) outcome of a sophisticated voting procedure called sequential voting by veto (SVV) applies to a more general situation than considered hitherto. According to this procedure a sequence of n voters must select s out of m + s options (s > 0, m I> n I> 2). The ith voter, when his turn comes, vetoes k i options (ki >/1, P. k~ = m). The s remaining non-vetoed options are selected. Every voter is assumed to be fully informed of all other voters' total (linear) preference orderings among the competing options, as well as of the order in which the veto votes are cast. This algorithm was proposed by Mueller (1978) for the special case where s and the k~ are all equal to 1, and extended by Moulin (1983) to the somewhat more general case where the k~ are arbitrary but s is still 1. Some theoretical and practical issues of voting by veto are discussed.