Woodall's method: Difference between revisions

Whew! This article needs some love. Added a cleanup tag to that extent and rewrote the intro sentence.
(or vice versa)
(Whew! This article needs some love. Added a cleanup tag to that extent and rewrote the intro sentence.)
 
(12 intermediate revisions by 4 users not shown)
Line 1:
{{cleanup|reason=Needs substantial rewriting, reformatting, and inclusion of properties it passes and fails.}}
== Definitions and Important Properties of Woodall's Method and Two Similar Methods ==
 
'''Woodall's method''' or '''Smith,IRV''' is a voting method that combines [[instant-runoff voting]] and [[Condorcet]]. It was invented by [[Douglas Woodall]].
 
'''== Woodall's method:''' ==
{{definition|Do IRV till only one member of the initial [[Smith set]] remains un-eliminated. Elect hir.}}
Do IRV till only one member of the initial Smiths set remains
un-eliminated. Elect hir.
[end of Woodall definition]
Smith set:
{{definition|The Smith set is the smallest set of candidates such that every candidate in the set beats every candidate outside the set.}}
 
candidate in the set beats every candidate outside the set.
[end of Smith set definition]
IRV definition (for the purpose of Woodall):
{{definition|Repeatedly, cross-off or delete from the rankings the candidate who tops the fewest rankings.}}
tops the fewest rankings.
[end of IRV definition for the purpose of Woodall]
 
Definition of "beats":
{{definition|X beats Y if more ballots rank X over Y than rank Y over X.}}An alternative (but equivalent) definition of Woodall's used in James Green-Armytage's Condorcet-IRV paper<ref>http://www.votingmatters.org.uk/ISSUE29/I29P1.PDF</ref>:<blockquote>Score candidates according to their elimination scores, and choose the Smith set candidate with best score. That is, define each candidate’s elimination score as the round in which he is eliminated by AV [IRV].</blockquote>
X beats Y if more ballots rank X over Y than rank Y over X.
[end of "beats" definition]
 
=== A few properties of Woodall ===
----
Woodall meets the [[mutual majority criterion]], and [[chicken dilemma criterion|has no chicken dilemma]]. Woodall meets the [[Condorcet criterion]], and the [[Smith set|Smith criterion]].
Meeting Smith always implies meeting the [[mutual majority criterion]], and [[Condorcet loser criterion|Condorcet loser]] as well.
A few properties of Woodall:
Woodall meets the Mutual Majority Criterion (MMC), and has no chicken
dilemma. Woodall meets the Condorcet Criterion (CC), and the Smith Criterion.
Meeting Smith always implies meeting MMC, and Condorcet Loser as well.
 
Woodall doesn't meet [[FBC]]. Like all Condorcet methods, Woodall fails Consistency, Participation, Mono-Add-Top, and Mono-Add-Unique-Top. Woodall fails Mono-Raise, but passes Mono-Add-Plump and Mono-Append.
Woodall doesn't meet [[FBC]]. FBC is necessary only under current conditions (dishonest, disinformational media, and an electorate who believe those media). Woodall isn't proposed for current conditions. Likewise for the similar methods proposed later at this page.
 
Consistency criteria: Woodall, like all Condorcet methods, fails Consistency, Participation, Mono-Add-Top, and Mono-Add-Unique-Top. Woodall fails Mono-Raise, but passes Mono-Add-Plump and Mono-Append.
 
Woodall's importance comes from its unmatched freedom from strategy-need, made possible by MMC, freedom from chicken dilemma, and CC. Advantages such as that come at a price. The abovementionedabove-mentioned combination of properties appears to be incompatible with FBC and with Mono-Raise, Participation, Mono-Add-Top and Mono-Add-Unique top. Choice of a voting system always involves choice among properties.
 
The consistency criteria don't have strategic importance.
===Consequences of Woodall's properties===
----
Definition of MMC:
A mutual majority (MM) is a set of voters comprising a majority of the
voters, who all prefer some same set of candidates to all of the other
candidates. That set of candidates is their MM-preferred set.
If a MM vote sincerely, then the winner should come from their MM-preferred set.
A voter votes sincerely if s/he doesn't vote an unfelt preference, or
fail to vote a felt preference that the balloting system in use would
have allowed hir to vote in addition to the preferences that she
actually does vote.
To vote an unfelt preference is to vote X over Y if you prefer X to Y.
To vote an unfelt preference is to vote X over Y if you don't prefer X to Y.
[end of MMC definition]
----
Consequences of Woodall's properties:
As with IRV, Woodall's MMC compliance and freedom from chicken dilemma
Line 77 ⟶ 34:
ranking sincerely, ensure that the winner will come from their
MM-preferred set. They can assure that, even while fully, freely and sincerely choosing
_among_''among'' that MM preferred set by sincere ranking. And freedom from
chicken dilemma means that that MM have no need to not rank sincerely.
Line 84 ⟶ 41:
But Woodall additionally, as well as possible, guarantees automatic
majority rule to _all_''all'' majorities, however constituted, by always
electing the voted Condorcet winner (CW)
Line 90 ⟶ 47:
of the other candidates (as "beat" was defined above).
== Schwartz Woodall ==
 
----
 
'''Benham's method:'''
Benham is a method similar to Woodall. Benham can be defined a bit
more briefly, because it doesn't mention the Smith set, though Benham,
like Woodall, always chooses from the Smith set. But Woodall is more
particular than Benham is, regarding which Smith set member it
chooses.
Benham:
Do IRV till there is an un-eliminated candidate who beats each one of
the other un-eliminated candidates. Elect hir.
[end of Benham definition]
 
----
 
It should be pointed out that, of course, if there is a CW, then
Woodall and Benham, by their above-stated definitions, will elect that
CW without doing any IRV.
 
----
 
For current conditions (disinformational media and an electorate who
believe those media), [[FBC]] is necessary.
 
[[Approval]], [[Score]] ("[[Range]]"), and
[[Symmetrical ICT]] meet FBC, and are good proposals for current
conditions.
FBC is important only for current conditions.
But, other than for current conditions, FBC would no longer be needed,
and then the powerful above-described properties-combinations of IRV, Woodall, and
Benham become important and decisive.
 
----
 
'''Schwartz Woodall'''
 
{{Merge to|Schwartz Woodall|date=August 2019}}
 
Schwartz Woodall is a variation of Woodall, and an improvement for
small electorates, such as organizations, meetings or families.
Line 145 ⟶ 53:
Schwartz Woodall:
{{definition|Do IRV till only one member of the initial [[Schwartz set]] remains un-eliminated. Elect hir.}}
un-eliminated. Elect hir.
 
== Notes ==
[end of Schwartz Woodall definition]
[[Benham's method]] is similar, but always terminates in the same round as Woodall's or earlier. This is because the two methods are identical to [[IRV]] until their algorithms' completion, but Benham's method can potentially terminate in a round where there are still multiple members of the Smith set remaining i.e. a member of the Smith set whose only pairwise loss or tie is to one of the other candidates in the Smith set would become a [[CW]] if that other candidate is eliminated, and be the Benham winner.
 
The Schwartz set has two equivalent definitions:
==References==
<references />
The beatpath definition of the Schwartz set:
There is a beatpath from X to Y if X beats Y, or if X beats something
that has a beatpath to Y.
X has a beatpath to Y if there is a beatpath from X to Y.
X is in the Schwartz set if there is no Y such that there is a
beatpath from Y to X, but not from X to Y.
[end of beatpath definition of the Schwartz set]
Unbeaten set definition of the Schwartz set:
1. An unbeaten set is a set of candidates none of whom are beaten by
anyone outside that set.
2. An innermost unbeaten set is an unbeaten set that doesn't contain a
smaller unbeaten set.
3. The Schwartz set is the set of candidates who are in innermost unbeaten sets.
[end of unbeaten set definition of the Schwartz set]
 
[[Category:Smith-efficient Condorcet methods]]
End of page
[[Category:Condorcet-IRV hybrid methods]]
1,200

edits