Rank with cutoff runoff 2.0
-
@jack-waugh ah yes, I didn’t mean that the factions would literally conspire to support only or mostly a single candidate, or even that they would recognize themselves. What I meant is that if there are two clones with top support, they can’t crowd out the election, because the one who loses the runoff will get eliminated, and the other will still have to beat out the next top-supported candidate. This is what enables independence of clones, but I think it could also work from the bottom-up like you mentioned.
For example, if a plurality faction supported two clones A and A’, and conspired to rank A>A’, this ultimately would amount to them having supported only A. The remaining top faction might have candidate B as their top support, and A would need to beat B in a majoritarian rank runoff in order to win.
-
@cfrank said in Rank with cutoff runoff 2.0:
I think the net result of both ballots is neutral.
To prove that, we can consider absolute scores for support and pairwise scores for preferences.
Antivotes support complementary sets of candidates. This just biases up all the support scores, which has no effect on the determination of the top (or bottom) two.
For each pair of candidates, antivotes balance in the preference score for that pair, so taken together, the two votes have no net effect on decisions based on preferences during the tally. QED
-
Do you want to permit equal ranking everywhere?
-
@jack-waugh yes, although perfect alignment of the support cutoffs becomes a priori less probable with more candidates, ignoring political spectrum forces.
-
@jack-waugh I think it only makes sense to permit equal rankings between mutually supported or mutually unsupported candidates. If you’re indifferent between two candidates, there is no reason you should support one over the other. Every unsupported candidate must be ranked lower than every supported candidate.
It is possible I suppose to support every candidate, and also not to support any candidate. Between the two there isn’t any effective difference, since only the ranking will have any influence over the result. With either style somebody could indicate indifference between every pair of candidates, and in that case they might as well just not have voted.
-
This post is deleted! -
I think these are Condorcet compliant. If there is no Condorcet winner, the support aspect will determine the order of eliminations. But if there is a Condorcet winner, the order of the eliminations doesn't matter.
-
@jack-waugh it is certainly Condorcet (or any other rank-criterion) compliant if the candidate pool is restricted according to the rankings even before the support-based runoff sequence begins.
-
@cfrank said in Rank with cutoff runoff 2.0:
restricted according to the rankings
How does that work?
-
@jack-waugh before considering the support aspect, you could just ignore all candidates who are not in the Smith or Landau set, for example. This is maybe peculiar though, since in principle it makes it possible that the winner is a candidate who doesn’t have much support at all. And this is perhaps a fair argument against the Condorcet criterion when certain additional information is provided.
-
Unless I am mistaken, no restriction is necessary and the system will still find the Condorcet winner if there is one, just like Llull's last system. Any order of elimination would do this.
-
@jack-waugh you’re right. No matter what, the runoff will eventually eliminate anybody who is not the Condorcet winner if one exists. It should also eliminate any Condorcet loser. It still leaves open the possibility of electing a candidate with low support, even if they are the Condorcet winner.
Maybe that’s fine? I’m sticking with the philosophy of “if people prefer something else, they should say so.” Aka, they should on the whole provide candidates that represent their preferences and fill the spectrum of feasible options, rather than relying on gamified quantifications of how much they prefer one thing over another.
-
Here is a cut at a voting decision-procedure. I rate the candidates on a continuous scale, exaggerating support for the lesser evil (but not past another candidate) if I think the real good candidates are extremely unpopular or unknown. I push the ones at Mussolini-level or below off to the side and consider the rest. I position my cutoff randomly on the scale. The more distance between two adjacent candidates, the more likely the cutoff goes there. I then convert the ratings of all the candidates to ranks and vote.
-
@jack-waugh why not simply place the cutoff between the two candidates with the largest difference? Or is it a clustering problem?
I tend to think that preferences are always conditional, and it doesn’t actually make sense to place all preferences on the same scale. You would prefer candidate B if you can’t have candidate A. And if you can have neither, you prefer candidate C, etc.
The “strength” of preferences I think shouldn’t spurn larger numerical differences on a scale, but rather should motivate indicating a larger number of intermediate alternative preferences. Which, in an idealized voting system, would manifest as candidates.
-
@cfrank said in Rank with cutoff runoff 2.0:
why not simply place the cutoff between the two candidates with the largest difference?
Because when many voters choose randomly, the effect is the same as though fine-grained Score ballots were being collected and tallied, and I believe that the finer grain has better effect at defeating money and fame effects.
-
This is an example system with two distinct aspects in every vote. For which of such systems can we say that it suffices (for an optimal vote) to Gibbard just one of the aspects and vote your values in the other aspect?
-
@jack-waugh I’m not sure about this, the most obvious forms of strategy here would be Turkey raising and burial, aka supporting certain candidates or choosing not to support certain candidates tactically. And I think this only helps in the event that there isn’t a Condorcet winner.
-
@cfrank said in Rank with cutoff runoff 2.0:
spiral quickly into becoming as convoluted as possible.
An alternative is the opposite: make them as simple and transparent as possible, so everyone engages in them and achieves equal power to everyone else.
-
@jack-waugh definitely, I agree.
So this system is basically just a particular Condorcet method. I had a thought to mitigate the high support vs Condorcet issue, which is something possibly complicated like this:
Rather than a majoritarian runoff between A and B occurring across the whole electorate, split the electorate into those who support both A and B, those who support A but not B, those who support B but not A, and those who support neither.
In each group separately, determine the majoritarian rank runoff winner. Then aggregate the victories in each group according to their sizes to determine the overall runoff winner.
For example, if the groups are designated +A+B, +A-B, -A+B, and -A-B, and we have a function N that returns the relative size of the group, say
N(+A+B)=0.4
N(+A-B)=0.1
N(-A+B)=0.2
N(-A-B)=0.3And a function M that returns the majority runoff winner of each group, say
M(+A+B)=B
M(+A-B)=A
M(-A+B)=B
M(-A-B)=BThen in this case, B would win the overall runoff by securing 04+0.2+0.3=0.9 points. It’s possible though that if the overall runoff had been majoritarian over the entire electorate without considering support status, then A would win instead.
This may be too convoluted, but it’s essentially the way we vote by district. In this case the “districts” are classes of voters determined by their support status for A and for B (rather than, say, gerrymandering).
Let me also say, this kind of thing may make people “put their money where their mouth is,” since if they support both A and B, for example, they implicitly agree by the mechanism to effectively support whichever of A or B wins the +A+B runoff.
-
@cfrank, using the grouping that you describe in 2881, votes that look formally "opposite" would be separated into different groups wrt ea pair of candidates, and so I'm pretty sure it would break the balance.
basically just a particular Condorcet method.
It collects more information than most, and goes beyond mere ranking.
-
Moved from Single-winner by
SaraWolk