Difference between revisions of "Talk:Definite Majority Choice"

From Electowiki
Jump to: navigation, search
(Strategic Vulnerability?)
(Strategic Vulnerability?: Rebuttal)
Line 35: Line 35:
  
 
Note: There's little risk in extending approval to inferiors even when one does NOT know if a paradox looming. Therefore, approval extension will probably become automatic voter behavior, rendering DMC's approval results misleading, and that will lead to voter confusion and dissatisfaction as apparently highly popular candidates are regularly declared to be losers. Perhaps this effect on all elections, rather than the effect during paradoxes, is what will render DMC completely unworkable. [[User:Jrfisher|Jrfisher]] 10:46, 14 Sep 2005 (PDT)
 
Note: There's little risk in extending approval to inferiors even when one does NOT know if a paradox looming. Therefore, approval extension will probably become automatic voter behavior, rendering DMC's approval results misleading, and that will lead to voter confusion and dissatisfaction as apparently highly popular candidates are regularly declared to be losers. Perhaps this effect on all elections, rather than the effect during paradoxes, is what will render DMC completely unworkable. [[User:Jrfisher|Jrfisher]] 10:46, 14 Sep 2005 (PDT)
 +
 +
[[User:Araucaria|Araucaria]] responds:
 +
 +
First of all, your example is not complete.  There are 15 possible ballots that could be submitted in a 3 candidate race.
 +
# A
 +
# A>B
 +
# A>>B
 +
# A>C
 +
# A>>C
 +
# B
 +
# B>C
 +
# B>>C
 +
# B>A
 +
# B>>A
 +
# C
 +
# C>A
 +
# C>>A
 +
# C>B
 +
# C>>B
 +
 +
A's approval comes from (1-5,9,12); B's approval comes from (2,6-10,14); C's approval comes from (4,7,11-15).  A>C votes come from (1-5,9,10); etc.  If you first specify some range of conditions, such as all approval ratings > 50%, or all < 50%, then it is possible to generate ballot combinations from the space of possible solutions.  Could you give an example of a set of ballots that demonstrate your case?
 +
 +
Secondly, polling is imprecise, usually accurate only to within 3%.  So "narrow" difference of approval makes strategizing risky, if there is a possibility of the strategy backfiring.
 +
 +
Third, consider how a 3 candidate cycle might arise.  With lower barriers to entry, the field is likely to be more crowded.  So the 3 candidate cycle might not be known in advance.
 +
 +
Fourth, even if there are only 3 candidates:  if the weakest defeat is B>A, then A and B are more closely aligned and are each other's compromise candidates over C.  You describe a situation in which A's camp attempts to wrest the victory from their allies.  This is sometimes known as the prisoner's dilemma betrayal strategy.  If A's camp tries that, B's camp is likely to withhold approval from A.  If the approval ratings are as narrow as you say, A will no longer be the highest approved candidate, and either B or C might win.
 +
--[[User:Araucaria|Araucaria]] 10:44, 15 Sep 2005 (PDT)

Revision as of 09:44, 15 September 2005

Majority?

Please let us avoid the term "majority" when there need not be any majority involved! Look at this:

1 A>>B>C
1 B>>C>A
1 C>>A>B
3 A=B=C

Here no "majority agrees" that any candidate should be eliminated! [Heitzig-j]

So ties have to be discussed
No, I didn't talk about ties but about majorities! In the above example, there are defeats but no majorities in the usual sense of more than half of the voters. [Heitzig-j]
I think I sent a suggestion in private email, but here it is again.
The initial page I put up was intended as a public elections proposal. So I wasn't thinking about ties.
In DMC, we eliminate candidates that lose pairwise matches to higher-approved candidates. Call the set of remaining candidates P.
If there is a tie, or if in a public election there is a near-tie (difference of, say, 0.01%), what about forming the superset P*, the union of all P's resulting from all possible reversed close races.
Then choose the winner by Random Ballot.

Strategic Vulnerability?

If a faction sees a Condorcet paradox looming, can it gain an advantage by insincerely approving of the contender that it expects to defeat pair-wise?

Your polling data: Approval runs narrowly A>B>C, but pairings run A>C>B>A, so 'B' stands to win under DMC. You're the tactician for faction 'A'. Can your supporters insincerely increase approval of 'C' in order to eliminate 'B'?

If so, then it doesn't even matter if you over-do it: As long as you expect to win head to head, you may hand out approval points with impunity and perhaps steal a victory. Of course, once this leaks out, 'C' will boost 'B', and 'B' will boost you... and the faction controlling the most first place votes will bury its nemesis and prevail.

So, in practice, will DMC degenerate into basic Condorcet with whatever limitations that has? Jrfisher 19:12, 29 Aug 2005 (PDT)

Note: There's little risk in extending approval to inferiors even when one does NOT know if a paradox looming. Therefore, approval extension will probably become automatic voter behavior, rendering DMC's approval results misleading, and that will lead to voter confusion and dissatisfaction as apparently highly popular candidates are regularly declared to be losers. Perhaps this effect on all elections, rather than the effect during paradoxes, is what will render DMC completely unworkable. Jrfisher 10:46, 14 Sep 2005 (PDT)

Araucaria responds:

First of all, your example is not complete. There are 15 possible ballots that could be submitted in a 3 candidate race.

  1. A
  2. A>B
  3. A>>B
  4. A>C
  5. A>>C
  6. B
  7. B>C
  8. B>>C
  9. B>A
  10. B>>A
  11. C
  12. C>A
  13. C>>A
  14. C>B
  15. C>>B

A's approval comes from (1-5,9,12); B's approval comes from (2,6-10,14); C's approval comes from (4,7,11-15). A>C votes come from (1-5,9,10); etc. If you first specify some range of conditions, such as all approval ratings > 50%, or all < 50%, then it is possible to generate ballot combinations from the space of possible solutions. Could you give an example of a set of ballots that demonstrate your case?

Secondly, polling is imprecise, usually accurate only to within 3%. So "narrow" difference of approval makes strategizing risky, if there is a possibility of the strategy backfiring.

Third, consider how a 3 candidate cycle might arise. With lower barriers to entry, the field is likely to be more crowded. So the 3 candidate cycle might not be known in advance.

Fourth, even if there are only 3 candidates: if the weakest defeat is B>A, then A and B are more closely aligned and are each other's compromise candidates over C. You describe a situation in which A's camp attempts to wrest the victory from their allies. This is sometimes known as the prisoner's dilemma betrayal strategy. If A's camp tries that, B's camp is likely to withhold approval from A. If the approval ratings are as narrow as you say, A will no longer be the highest approved candidate, and either B or C might win. --Araucaria 10:44, 15 Sep 2005 (PDT)