Composite method: Difference between revisions

m
Added cn as I couldn't find any sources for this term.
mNo edit summary
m (Added cn as I couldn't find any sources for this term.)
 
(2 intermediate revisions by one other user not shown)
Line 1:
CompositeA methods'''composite aremethod''' is a voting methodsmethod constructed by combining multipleseveral other methods. Usually setsSets like the [[Smith set]] or [[uncovered set]] are considered to be non-[[Resolvability criterion|resolute]] methods in this context.
 
Common compositions include:
Two common method compositions used on the [[election-methods list]] are the comma and double slash (or slash) compositions. These are as follows:
 
* '''Condorcification''', which modifies the base method by electing the Condorcet winner (if one exists) as the first step.
* '''Smithification''',{{cn}} which begins by eliminating all candidates outside the [[Smith set]].
 
Two common method compositions used on the [[election-methods list]] are the comma and double slash (or slash) compositions. These are as follows:
 
==Comma==
Line 16 ⟶ 21:
This composition was first defined by Woodall in 2003.<ref>{{cite journal|last=Woodall|first=D. R.|date=2003|title=Properties of single-winner preferential election rules II: examples and problems (draft)}}</ref>
 
==SlashDouble-slash==
 
The composition M1//M2 denotes taking the result of method M1, eliminating everybody but the winners according to that method, and then giving the outcome of M2 on the reduced ballot set. For instance, the method that first eliminates every candidate not in the [[Smith set]], then runs IRV on the remaining candidates, is [[Smith//IRV]].
1,205

edits