Composite method

A composite method is a voting method constructed by combining several other methods. Sets like the Smith set or uncovered set are considered to be non-resolute methods in this context.

Common compositions include:

• Condorcification, which modifies the base method by electing the Condorcet winner (if one exists) as the first step.
• Smithification, 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.

Comma

The composition M1,M2 denotes taking the result of method M1, then breaking any ties in the ordering by using M2. For instance, for the following ballot set:

10: L>A>B>C>R
 8: R>B>C>A>L
 5: C>A>B>L>R

The first past the post ordering is L>R>C>A=B and the Smith set is {A, B, C}. Thus the method Smith,Plurality would return the ordering C>A=B>L>R.

This composition was first defined by Woodall in 2003.

Double-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.

This composition was first defined on the EM list by Bruce Anderson in 1996.

Criterion compliances

If M1 and M2 are two methods, then M1,M2 is monotone if:

• M1 and M2 are both monotone
• Raising a candidate X can't add another candidate Y into the M1 set (or make Y tie for first if M1 is a method).

M1//M2 is monotone if:

• M1 and M2 are both monotone
• Raising a candidate X can neither add nor remove another candidate Y from the M1 set (or tied for first).

These are sufficient conditions: methods can be monotone even if they fail these conditions. For instance, Copeland//Borda (Ranked Robin) is monotone even though the conditions are not met.

This page is a stub - please add to it.