If you randomly remove one ballot, then A wins in 3 of 6 possible cases, B wins 2 of 6, and one is a B-C tie.
I have no opinion on who should win. For me this is just a 3-way tie.
If you randomly remove one ballot, then A wins in 3 of 6 possible cases, B wins 2 of 6, and one is a B-C tie.
I have no opinion on who should win. For me this is just a 3-way tie.
This idea is quite similar to MARS. And in the examples you list, MARS would yield the same results each time (assuming a range 0-3). The main difference is that it seems you imply strict rankings. This creates a teaming effect. The A voters fail to win strategically, because of the number of candidates supported by the other group, not because of a resistance to polarization inherent in the method. When you think about it, it's quite odd if a majority has no way to vote that ensures them winning (majority criterion).
The problem is that, even with cardinal methods, you can't escape the Condorcet paradox with all the problems it implies.
Say you have three candidates and nine voters with the following preferences:
3: A > B > C
3: B > C > A
3: C > A > B
Then when you consider for each group of voters the best strategy under approval voting and repeat that for some iterations always based on the previous poll, the winner will turn in cycles.
Yes, but by including everyone approved by a majority, this is already the case. If in the second round people narrow their support, that's the point of the second round.
The wording "the top two most approved candidates and anyone approved by a majority" ensures that there is always a majority. Either in the first round or the second. If there is no majority in the first round then the top two advance and it is like a regular runoff.
(It would be possible that a enough people submit an empty ballot in the second round and thereby cause both candidates to fail the majority, but one could count them as invalid - just like in every other runoff.)
When holding an approval vote, which for some (legal) reason requires a runoff. Should it include all candidates approved by a majority of voters?
I started thinking about this as I tried to simplify score interval voting (SIV). The idea behind SIV is to identify possible cases of the chicken dilemma and have those candidates only compete in a second round while excluding the other. By the nature of the chicken dilemma, in most cases there is a majority which prefers some set of candidates to everyone else but is divided about who of those candidates should win. Therefor, it should be possible to avoid the CD (in most cases) if we just take all candidates approved by a majority and advance them to the second round. This isn't a complete fix but should be good enough as a practical approximation.
With this template one could think of several voting methods.
majority approval, with approval runoff:
Approval voting in the first round. The top two candidates and everyone approved by a majority of voters advances to the second round of approval voting.
majority approval // score:
Using a score ballot. Every score above 0 is considered an approval. The top two candidates and everyone approved by a majority of voters advances to the second round. The second round is using the same ballot data for score voting.
majority score // BTR-score:
Like BTR-score, order the candidates by score and have a bottom-two-runoff until one candidate remains. But limit the set of candidates to all which have more than 50% of the possible score.
The idea is related to graded Bucklin methods.
I think the first one is especially useful because of its simplicity. Some places already require an obligatory second round (primary and general in the US). In such cases it's an easy way to address the most common criticisms of approval voting - that you have to think to much about strategy in order to vote. It also addresses the question why you have a runoff after an approval vote with two potentially very similar candidates.
@jack-waugh said in MARS: mixed absolute and relative score:
Your first example supposes that voters leave power on the table. We're not going to see that in a political election that matters.
Then again in your first example for MARS, you have 35 voters giving scores 4 4 0 when the top of the range is 5.
There are many voters who don't vote at all. Some intentionally because they don't like any of the alternatives. Likewise I think it's very likely that some voters will only use the lower part of the range, because they don't like any of the alternatives.
However, this method and the examples don't depend on that aspect.
The same example using the full range:
voters | A | B | C | D |
---|---|---|---|---|
32 | 4 | 0 | 5 | 0 |
33 | 4 | 5 | 5 | 0 |
17 | 3 | 5 | 0 | 0 |
18 | 5 | 3 | 0 | 0 |
score | 401 | 304 | 325 | 0 |
One could see it as ironic that experts in voting can't manage to agree on the best voting method. Then laugh and put the topic down.
But, we know that no voting method can force a majority if there is non in the electorate. The same is true for a Condorcet winner or finding a consensus. And going one step further back, maybe there isn't a single answer to that question.
I yesterday started to write two articles about the question, what makes a good voting system? Two articles because I arrived two answers.
The first one very practical.
Let's look at some obvious desirable criteria: satisfaction, fairness and simplicity (Jameson Quinn already wrote about that somewhere). In theory (if we had enough information) we could plot all voting systems on a three dimensional graph. But then the question is, which is the "best"? One might be very fair (resistant to strategy), but give medium satisfaction and is medium complex (e.g. MJ). While another gives good satisfaction and is simple, but easy to manipulate (e.g. score).
Instead of looking for the best one we could exclude every system which is worse than another in all three categories. This leaves us with a pareto front of several voting systems that are reasonably good.
Without having enough data, I guess this could look something like this (from simple to more complex):
approval, score, STAR or 3-2-1, Smith//score, Woodall's or Benhams' method
The second argument is more philosophical.
Since we know that no deterministic voting method can be strategy free we can ask our selves: How do we deal with strategy? While trying to map which voter strategies are possible I came to the conclusion that most fall in one of three categories: Dishonest preferences (favorite betrayal), Chicken Dilemma and Exaggeration.
The last of these is pretty much unavoidable. The other two can be avoided and I think it's important we do. The both represent a failure to cooperate. In terms of game theory, the first as prisoners dilemma, the second as the game of chicken. Failing to cooperate isn't only some obscure quirk in the niche science of voting theory, but actively harmful to society. If we could fully fix this, then this would be a huge advancement to humanity.
So I think, the voting reform movement currently tries to fix the spoiler effect and somewhat improve the selection of the winner. But when we have achieved this and the whole world is using some Condorcet or score method, then we will find that FB and CD are real problems we have to deal with. That this isn't utopia yet.
Finding methods that avoid both problems is hard, because solving CD in a strong sense implies having FB. It is however possible to solve CD in a weak sense.
These method, as far as I can see, achieve this:
ICT, MAV, MCA (some variants), MMPO, SIV
(The next step would be to filter out those that are subject to clones.)
As a bonus argument, one could say that we can avoid strategy altogether with non-deterministic methods. They also are more "fair" in the sense that they give every voter an equal chance of being heard. Therefor the best methods would be:
random ballot, random pair
Now with these arguments alone there are over a dozen methods that could qualify as "best", depending on the definition. So maybe there isn't really an answer to that question and which methods would be wise to use, depends very much on the situation.
@rob said in MARS: mixed absolute and relative score:
Is there any reason you think blending Condorcet and "utility based" will help reduce strategic incentives?
It was my initial intuition, that just like in STAR, the incentives to min-maxing and expressing dishonest ranking (e.g. burying) would conflict and partly cancel out.
Strategy under Condorcet involves creating or breaking a cycle. In MARS you would have to create a cycle in combined votes and score. But because score is linear it's harder to do this. And because the two metrics are correlated it's hard to burry A under B, without giving B a higher score which might allow them to beat your preferred candidate C.
So there are two cases:
You try to predict the outcome and pick the best strategy. This requires a good prediction and using only one strategy might not be enough to shift the result.
You employ both strategies and accept the higher risk that either of them backfires (or both).
Overall I think the cases where a strategy works are rarer, harder to predict and more likely to backfire. While you have more options compared to either score or Condorcet, I think in sum it's more robust against strategies.
However, I have no evidence beside reasoning. It would be great to see it tested in some VSE simulation.
Edit:
I just realized there is a simpler argument to be made. If you min-max like in score, you miss out in using preferences. If you express a dishonest order, you miss out in using scores. Either way, using one metric to vote strategically prevents you from using the other to advance your goal. A strategy is only helpful if you know that you won't need the other metric, which again is rare, hard to predict, hard to coordinate and risky.
As you all know Germany uses MMP for elections to the Bundestag (national parliament).
There currently is a commission for electoral reform reviewing changes to the system. In a recent paper they propose a fundamental shift in how the MMP system works and consider approval voting and IRV as possible methods for district mandates.
As background, the current system is a mixed member proportional system. There is nothing in the constitution demanding any particular system, but this was invented in 1949 and since only changed slightly.
Voters have two votes. One for a candidate in their district and one for a party. The party vote determines the proportion of parties in the parliament. There is a 5% threshold, so it's not entirely proportional and many votes are just ignored. Proportionality is calculated both at the level of the Länder (=states) and nation wide, but I spare you the details. (The electoral law has been called "the law that makes people crazy" by an expert in a previous commission.)
A main problem with this is that a party can win more districts than they have seats to fill by the proportional vote. The solution, until now, was to increase the total size of the parliament until this isn't an issue any more. However, with this there is no limit to parliament size. In the last election there where 736 seats instead of the regular 598. Which makes the Bundestag the second largest national parliament after China. This for one costs a lot of money, it reaches the limits of what the parliament building can physically support and it slows down the work.
The commissions task is to find a solution to this problem. It also discusses lowering the voting age and ways to better represent women.
Last week they voted on a paper outlining the direction for the new voting system (pdf, German) ("Eckpunktepapier" lit.: corner point paper).
There will be exactly 598 seats and 299 districts. Voters still have two votes. The party vote determines the number of seats for each party. When a party has won more districts than seats, they only send the candidates with the best results, the leftovers don't get a seat.
E.g. Party A has won 35 districts, but is only entitled to 30 seats, therefor the 5 worst winners aren't elected.
Then the question is what happens to those left over districts. They shouldn't be vacant, because then the voters aren't directly represented and also have less of a vote than everyone else. So they list four alternatives:
a) A "replacement" vote. Voters get to mark a secondary preference, but it is only counted when the candidate with most votes isn't covered by the party vote.
b) Keep plurality voting and elect the second best candidate.
c) Implement Approval voting and elect the second best candidate.
d) Implement IRV and elect the second best candidate.
My comment on this proposal:
I would have liked to see multi member districts, but was aware that the chance for is was very small. The new rule solves the main problem but does nothing to improve the voting system or address the many other problems it has.
a) This is confusing to voters and mostly useless. In the last election, it would only have been relevant in 38 of 299 districts. So why should voters care to add another mark on the ballot. They already don't care about who wins the district.
b) Plurality voting is bad, but in this context it's even worse. You not only don't elect the candidate with the most votes, but one with no intersecting set of votes, i.e. the opponent. A right leaning district would be represented by a left candidate (or vice versa).
c) This is what I advocated for. Approval voting natively provides an ordering of candidates by popularity. It's no problem to elect the next best. I also hope that once approval has a use in Germany it will over time replace all other plurality elections and all runoff elections with approval+runoff.
d) There is no movement for IRV in Germany, but it still is the most widely known of the alternative voting methods. It doesn't provide a real ordering of candidates. The last candidate to be eliminated isn't necessarily the "second best", it very much depends on who is running and in what order they are eliminated. One object of the commission is to make the voting law simpler. With the above changes it takes a huge step towards this goal, IRV however would be detrimental to it.
In a previous petition and a recent letter (pdf, German) to the commission I advocated for the use of approval voting in the candidate vote, but also as cumulative voting in the party vote. If you would vote for four parties, each would get ¼ of your vote. I'm generally against a party vote threshold, but proposed that this could be used to reduce the number of ignored votes. In a first step count the votes and eliminate all parties that fail to reach the threshold, then count the votes again, but distribute among the remaining parties. So if you voted for 4 parties, but one got eliminated, then your votes goes with ⅓ to your remaining three parties.
That's the same idea the German NGO Mehr Demokratie proposes. I proposed a similar modification to MMP that uses approval voting for the direct mandate and multi party choice. The party vote is distributed equally among all approved parties, then all parties that don't reach the threshold are excluded and the vote is distributed equally among the remaining parties.
It has the same effect as a second choice, but with the added benefit that voters don't have to limit their vote to one party.
I have worked on MARS voting for some months now, revising it several times and going from complicated to very complicated. The latest version I will present here is simplified to a level where it can be explained to someone with no background in voting theory. But I still think this method is not for use in elections for public offices.
MARS voting is an attempt to find a middle way between Condorcet and utility based philosophies for single winner elections. I hoped that this balances out the strategic incentives in either group, but it might be that the best strategy is a combination of burial and min-max.
It is possible to contrive ridiculous examples to show that either cardinal or Condorcet methods will pick the "wrong" winner.
voters | A | B |
---|---|---|
101 | 100 | 99 |
100 | 0 | 99 |
B scores almost two times the number of points than A, but a majority vote would elect A.
voters | A | B |
---|---|---|
99 | 1 | 0 |
1 | 0 | 100 |
Here 99% prefer A over B, but score elects B.
In MARS voting, defeats by score or votes are compared to each other and the one that is more significant counts. This rule is very general and can be applied to many Condorcet methods, Minimax and others. For the method presented below I have chosen BTR, because it is relatively easy to explain.
In this example A is the score winner and Condorcet loser, while B is the Condorcet winner and score loser.
voters | A | B | C |
---|---|---|---|
32 | 4 | 0 | 5 |
33 | 4 | 5 | 5 |
35 | 4 | 4 | 0 |
score | 400 | 305 | 325 |
The candidates are ordered by score: A C B
In the runoff B versus C, B wins by votes 35% to 32% (margin 3%), but C wins by score 65% to 61% (margin 4%). So B is eliminated.
In the runoff C versus A, C wins by votes 65% to 35% (margin 30%), but A wins by score 80% to 65% (margin 15%). So A is eliminated and C is declared winner.
This again is a contrived example. Most of the time the Condorcet and utility winner will be the same, and in most other cases MARS with elect either of them. But even here is an argument to be made for electing C. When we eliminate the "obviously bad" candidates - the Condorcet loser and the utility loser - then only C is left as the least bad choice.
Obviously this method fails many voting criteria. I want to develop a version that is free from favorite betrayal, until then I don't recommend this one. The reason I post it here it to have a place to continue this ongoing discussion.
Earlier version have been discussed here:
score-better-balance
simplifying MARS voting
MARS on electowiki
As far as I can tell, the "score interval voting" described in the second post avoids 1. clone spoilers/teams 2. favorite betrayal 3. chicken dilemma (under strategy) and is the only method I know of which does (besides maybe MCA-P and MCA-AP?). For it to pass CD I assume that voters will fully support their favorite and fully betray their friend in the second round, then they can fully support both in the first round.
This doesn't formally satisfy the chicken dilemma criterion, as the formal definition requires that the defecting party does not win. However there is almost no incentive to defect and I think that in practice that would be sufficient to prevent the CD. The CD criterion requires a strong Nash equilibrium, but here we have a weak Nash equilibrium (see end of first post).
Why should this be important?
Spoilers reduce the number of candidates running. In the extreme you end up with two candidates. FB paired with an environment which makes it seem like there are only two viable candidates will also lead to two party domination. In a chicken dilemma voters individually have the incentive to defect which may lead to the majority to fraction and lose. When the chicken dilemma is not addressed, then it could devolve to a tactic where one fraction of the majority defects and the other fraction supports them to avoid the greater evil. Which again resembles the lesser of two evil problem.
Like plain score, interval voting is very well behaved regarding many criteria. I didn't check that thoroughly but think that the list below is 95% correct.
It passes:
clone independence, favorite betrayal, monotonicity, summability, LN-Help, cancellation, reversal symmetry, consistency, IIA (like score, assuming voters don't normalize)
It partly satisfies:
chicken dilemma (see above),
LN-Harm (for the first round only)
It fails:
CW, CL, Smith, majority, plurality
Note that the failed criteria are restrictions on who the winner should be, while most of the passed criteria are about strategic voting and strategic nomination. I would argue (which may be another post at some point) that the winner definitions shouldn't be viewed as strict criteria to pass 100%, but goals to approach. One could also define that the utility winner should always be elected, which could only be satisfied by some pure cardinal methods, but instead we look at VSE and see that Ranked Pairs performs well on this metric. So instead of the Condorcet criterion I would rather look at Condorcet efficiency.
Here is a variation on this idea which might be more elegant.
In the above description of score+, scores are used for the first round, but only approval for the second. It thereby loses part of the accuracy of score. The solution is to do two rounds of score.
Two round score works as follows:
For the voter it might feel like they give a benevolent and an egoistic score. Or - reminiscent of confidence intervals - an upper and a lower bound on what they are willing to score each candidate. It could be called "score interval voting" (SIV pronounced like sieve).
Let's go through the above example again.
The first group of voters love A, like B and hate C, but they also have an incentive to defect and give B a low score. So they vote A 5-5, B 0-3, C 0-0.
Likewise the second group votes A 0-3, B 5-5, C 0-0. The third group just votes for C.
By counting the higher score we get:
voters | A | B | C |
---|---|---|---|
35 | 5 | 3 | 0 |
25 | 3 | 5 | 0 |
40 | 0 | 0 | 5 |
score | 250 | 230 | 200 |
Again A and B share a lot of scores and therefor tie, while C gets eliminated.
Now we count the lower scores whereby A wins.
voters | A | B |
---|---|---|
35 | 5 | 0 |
25 | 0 | 5 |
40 | 0 | 0 |
score | 175 | 125 |
Other than before, voters can choose not to defect all the way to zero, but pick some intermediary value.
There is an issue with this approach. The best scored candidate in the second round will always have a lower score than the best scored candidate in the first round. Say in the first round A has 300 points, but B wins the second with 250. Then A top voters might be upset. It would be possible to introduce some additional mechanism to address this, but I think it is justified to say that this method only works because the second round picks the winner. Also, the second round already is some form of automatic runoff.
By using upper and lower ratings, this method fails the equal vote criterion (two ballots can cancel each other) and reversal symmetry. This can be fixed when we allow voters to mark their ratings in reverse order, say using a "1" for the lower and a "2" for the upper rating for the respective rounds.
However I don't care for reversal symmetry and it only fails equal vote for both rounds combined, but passes for each round individually. Say a ballot votes one candidate 5/3, then one could vote 0/0 to balance the first round or 2/2 to balance the second round. To vote 0/2 they would need the above rule. If one ballot would cause a candidate to pass the first round and win the second, another ballot could prevent that candidate from winning in either round.
[edit] This initial post about "score+" is obsolete, see the second post for a description of "score interval voting".[/edit]
Short summary:
With score and approval a common objection is that giving your second favorite any non zero score can cause them to beat your favorite. This is usual attributed to later-no-harm, but I think the real issue is the chicken dilemma. LN-harm is a very strict criteria and also excludes finding a compromise.
Say you have an election with three fractions.
voters | A | B | C |
---|---|---|---|
35 | 5 | 3 | 0 |
25 | 3 | 5 | 0 |
40 | 0 | 0 | 5 |
score | 250 | 230 | 200 |
Supporters of A and B cooperate, but under standard score voting B voters have an incentive to defect and give a worse rating to A in order to win.
voters | A | B | C |
---|---|---|---|
35 | 5 | 3 | 0 |
25 | 2 | 5 | 0 |
40 | 0 | 0 | 5 |
score | 225 | 230 | 200 |
Likewise A voter now have an incentive to defect, creating a spiral that causes both to lose and C to win.
voters | A | B | C |
---|---|---|---|
35 | 5 | 0 | 0 |
25 | 0 | 5 | 0 |
40 | 0 | 0 | 5 |
score | 175 | 125 | 200 |
This is a variation on the prisoner dilemma. Both cooperate, both win, one defects, one wins, both defect, both lose. To address this problem score+ alters the equation so that defecting still hurts your partner but doesn't give you any benefit. It doesn't fully avoid the CD as with a sufficient number of voters defecting it will still work, but the incentive for the individual voter is near zero.
To do this score+ counts votes who give either side some support as being able to shift the support in either direction. When A can beat B by 20 points, but enough B voters could withdraw their support to reverse the defeat, then the pair A versus B is counted as a tie. We then remove all candidates that have a defeat and find the winner among the remaining by some other metric than plain score.
Since the score winner can not be defeated in the first round, the set of remaining candidates will never be empty.
In this case 35 votes vote A 5, B 3 and 25 vote A 3, B 5, so they have 35x3+25x3 = 180 scores in common. We divide that by the max score 5 to get 36 points. While A beats B with 250 to 230 points, this can be reversed by adding the 36 points to B. Therefor this match is counted as a tie. C however is defeated by both A and B and therefor eliminated.
(Side note: To divide by 5 weakens the protective effect, but if one would use the full score, then almost no candidate would ever get eliminated and the whole processes would be useless.)
In the second round we only compare A and B by maximum score which A wins. Note that, if C where still present, C would win this round, because the first preference is split between A and B.
B voters also have little incentive to defect against A, like shown above. If they rate A 2, then the defeat B over A by 230 to 225 points can be reverse with the 31 points they still have in common. Only C is eliminated and in the second round A still wins.
There are two obvious limits to this approach.
It is still possible that all voters of one side defect and win, while the other side still cooperates. But such a coordinated effort would certainly become known to voters of the deceived side and they would retaliate with mutual destruction.
Also, since top scores are counted in the second round, the chicken dilemma is still present in top ratings. There are several alternative ways to resolve the second round, but I think this is the most consistent and it creates no new problems.
I'm not certain about the naming. Previously I thought about adding an additional top rating called "+" which would only be counted in the second round - therefor "score+". But that would be confusing and introduce some strange effects.
Edit:
Here is the payoff matrix for the above example. When we assume that voters don't know who will win, then A and B voters can expect that either A or B wins when they cooperate.
With regular score A or B voters can increase the chance of their candidate winning when they defect.
A/B | B cooperate | B defect |
---|---|---|
A cooperate | 4/4 | 3/5 |
A defect | 5/3 | 0/0 |
With score+, up to a certain point, defecting won't change the winner. Therefor cooperate/defect has the same payoff as cooperate/cooperate.
A/B | B cooperate | B defect |
---|---|---|
A cooperate | 4/4 | 4/4 |
A defect | 4/4 | 0/0 |
I recently read more about the class of "improved" Condorcet methods. Which use the tied at the top rule to redefine the notion of a Condorcet winner. It is claimed that this fixes favorite betrayal and possibly the chicken dilemma, while also being close to Condorcet methods.
This seems promising, so I wonder why there isn't much talk about them. Even from a practial viewpoint they are easier to explain than for example Schulze, or Smith//score.
In particular I am talking about Improved Condorcet Approval and Symmetrical Improved-Condorcet-Top.
The first article also describes a variant:
The above definition defines t[a,b] to be the number of voters tying a and b in the top position. ... However, it might be more intuitive, and preferred, if t[a,b] were defined rather as the number of voters ranking a equal to b and explicitly voting for both.
Why would that be preferred? And does this only work when explicitly ranking/approving both, or also for bottom ranks? In that case one could state the rule as just: "A candidate is unbeaten if there is no other candidate that is ranked higher by more than half of all voters." Which also would be easier to calculate and visualize.
Is there any reason not to extend ICA to ICscore using a rated ballot? ICscore could then be easily explained as "Rate all candidates on a scale from 0 to 5. Remove all candidates where some other candidate is preferred by more than half of voters. Of the remaining, elect the one with highest score."