<div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr">I think Kris is mostly correct when he says this: <blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">Over time, this incentive to entry could reduce STAR to Range.</blockquote><div>but I see this as intentional. Score and approval are great systems on their own. They elect Condorcet winners in the presence of strategy, but score does <i>better</i> than Condorcet if voters are honest. They satisfy sincere favorite, IIA, and rarely incentivize order reversal. It's hard to design something better that won't hurt the average voter's brain.</div><div><br></div><div>I expect that as soon as STAR is a thing, parties will start nominating candidates in pairs. This is good; it gives voters more choices. STAR is a two-step procedure, where first you hold a score vote to pick the frontrunners (because the first round is score), and then you hold what's effectively an approval vote to pick the single best candidate.<br></div><div><br></div><div>It's fun to imagine more complex voting systems, but I've come to recognize an iron law of voting systems: <b>every sufficiently well-designed voting system converges to score</b>. We have an impossible trilemma:</div><div>1. If your voting system doesn't respond to strategic exaggeration, it's not responsive to voters. (If you rank a candidate 1st, they damn well <i>should</i> do better than if you put them in the middle!)</div><div>2. If it responds to exaggeration but penalizes compression (ranking several candidates first makes them less likely to win, compared to ranking them all), it's Duvergerian (favorite-betrayal incentive).</div><div>3. If it responds to exaggeration but doesn't penalize compression, it's approval voting (at least if you have strategic voters).</div><div><br></div><div>Of these, it seems like voting theorists have converged on #3 being the least-bad option, although some systems try to compromise.</div><div><br></div><div>STAR tries to compromise between 2 and 3, but mostly sticks close to 3. It has a favorite-betrayal incentive, but it's negligible. (Only possible if the score-runner-up without your vote would win the runoff, but the score-runner-up with your vote would lose). It also gives slight decompression at the top end (sometimes you'll want to rate 4 stars instead of 5, to make sure your favorite beats your second-favorite).<br></div><div><br></div><div>The only way I can see us moving past this trilemma is if we have some outside-the-box mechanism. We can't <i>just</i> look at vanilla voting systems that pick the best candidate from a pool. We need to look at mechanisms that make support costly <i>across </i>races or decisions. Voters need to be on the hook if they try to just top-rate all their favorites, but that incentive has to come from paying a cost somewhere <i>other</i> than inside the race. If you try to make it costly to support multiple candidates at once (like cumulative voting does), you just get favorite-betrayal and plurality again.</div><div><br></div><div>Improvements on approval voting will probably come from some direction like working out how to make the VCG mechanism more resistant to coalitions and letting voters rate candidates across multiple races. Most decent voting systems are already up against the brick wall of top-shelf methods labeled Score/Approval/STAR/RP/Tideman alternative—notice that all of these except STAR were proposed more than 30 years ago, all give similar results in practice, and we <i>still</i> haven't figured out a way to beat them!</div></div></div></div></div></div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Tue, Mar 19, 2024 at 5:31 AM Kristofer Munsterhjelm <<a href="mailto:km_elmet@t-online.de">km_elmet@t-online.de</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">On 2024-03-19 02:05, Rob Lanphier wrote:<br>
> Hi folks<br>
> <br>
> I was asked to provide a quote supporting STAR voting by the Equal.Vote <br>
> Coalition (<a href="http://equal.vote" rel="noreferrer" target="_blank">equal.vote</a> <<a href="https://equal.vote" rel="noreferrer" target="_blank">https://equal.vote</a>>).<br>
<br>
[snip]<br>
<br>
> I think the Condorcet winner criterion (CWC) matters a lot more than<br>
> "cardinal" advocates often suggest, but it's almost impossible for me<br>
> to imagine a credible election scenario where the STAR winner and a<br>
> strictly CWC-compliant method would differ. More to the point, with that final<br>
> pairwise comparison, STAR virtually guarantees that a majority of voters <br>
> prefer the winner to the runner up. And it's 1000% better than RCV/IRV <br>
> as promoted by FairVote.<br>
<br>
The obvious thing that comes to mind that could make STAR fail Condorcet <br>
is the clone problem. It doesn't even have to be a deliberate strategy: <br>
it could just emerge from the incentives. Suppose that there are three <br>
parties: Left, Center, and Right. Say that Left often is the Range <br>
winner, but the Left-first voters is a minority so Center comes in <br>
second and wins the runoff.<br>
<br>
Then a second near-Left party has an incentive to grow, because if it <br>
can get strong enough, it knows that the left voters will also give it a <br>
high rating, so that the runoff now consists of two left-wing <br>
candidates, and thus one of them will win. If the rules permit a party <br>
to field multiple candidates, then it's even easier: the existing Left <br>
party can just field two.<br>
<br>
Over time, this incentive to entry could reduce STAR to Range.<br>
<br>
I agree that if we are to take strength of preference seriously (in the <br>
vNM sense, as I described in my other post), then it should, as you put <br>
it, take nuance into account, but not too much of it. I have some <br>
thoughts about how that could be done (I've written posts about it), but <br>
the methods would be considerably more complex.<br>
<br>
Or if you're on the ordinal side of the divide, <br>
Smith//Range(renormalized) would fix the clone problem for rated clones. <br>
But it wouldn't be monotone.<br>
<br>
The clone problem and entry incentive could be detected by simulation by <br>
replicating James Green-Armytage's work in the paper where he showed <br>
that IRV has an exit incentive. To my knowledge, nobody has done so yet, <br>
which would explain why you haven't seen any simulations of that form.<br>
<br>
-km<br>
----<br>
Election-Methods mailing list - see <a href="https://electorama.com/em" rel="noreferrer" target="_blank">https://electorama.com/em</a> for list info<br>
</blockquote></div>