Definite Majority Choice: Difference between revisions

Line 241:

==== Pairwise Ties ====

When there are no ties, the winner is the candidate in ~~Forest~~ ~~Simmon's '''~~[~~http://wiki.electorama.com/wiki/~~Techniques_of_method_design#Special_sets P]~~'''~~ set~~, the ''set of candidates which are not definitively defeated''~~.

When there are no ties, the winner is the least approved candidate in the [[Techniques_of_method_design#Special_sets|P]]) set.

In the event of a pairwise tie or ~~near~~ ~~tie~~ (say, margin within 0.01%), it is ~~sometimes~~ ~~possible~~ to ~~proceed~~ ~~anyway,~~ ~~since~~ ~~another member~~ of P ~~may defeat~~ the ~~tied~~ ~~pair.~~ ~~But~~ if there is no clear winner, ~~ties~~ ~~should~~ be handled using the same [http://wiki.electorama.com/wiki/Maximize_Affirmed_Majorities#Compute_Tiebreak Random Ballot] procedure as in [[Maximize Affirmed Majorities]].

In the event of a pairwise tie or a disputed pairwise contest (say, margin within 0.01%) among two members of the definite majority set, one of which is the least-approved member of the definite majority set, there is no clear winner. In that case, the tied contest could be handled using the same [http://wiki.electorama.com/wiki/Maximize_Affirmed_Majorities#Compute_Tiebreak Random Ballot] procedure as in [[Maximize Affirmed Majorities]].

Or the election could be decided in that case using [[Imagine_Democratic_Fair_Choice|Democratic Fair Choice]], which chooses a winner by random ballot from among the definite majority set.

== See Also ==