<div dir="auto">Kevin,<div dir="auto"><br></div><div dir="auto">I'm thinking about my initial reaction towards Yee diagrams ... too ideal ... too simple .... how could we learn anything from it?<div dir="auto"><br></div><div dir="auto">But I was pleasantly surprised!</div><div dir="auto"><br></div><div dir="auto">Of course Yee is not what we're looking for ... but is there something else simple and tame like Yee that might reveal some insights?</div><div dir="auto"><br></div><div dir="auto">For example ... distributions generated geometrically by n<10 random points in the Cartesian plane ... each point is a candidate position and each candidate has only one faction ... with all of its weight at the candidate position.</div><div dir="auto"><br></div><div dir="auto">Start with n=3, to confirm what we already think we know. Then increase n gradually and methodically. </div><div dir="auto"><br></div><div dir="auto">Along the way experiment with candidate withdrawal to see what happens when you have more factions than candidates, etc.</div><div dir="auto"><br></div><div dir="auto">Start with all factions equal in size ... how often do you get a CW?</div><div dir="auto"><br></div><div dir="auto"> If that's too ideal to learn from or plagued with too many ties ... add random small perturbations in faction size, etc.</div><div dir="auto"><br></div><div dir="auto">Eventually replace some candidates with clone sets.</div><div dir="auto"><br></div><div dir="auto">Or perhaps there is some other totally different simple approach.</div><div dir="auto"><br></div><div dir="auto">Personally I would shy away from continuous or large finite distributions or many factions for the same candidate (except those arising naturally by candidate withdrawal) until getting a thorough grasp of the simple cases.</div><div dir="auto"><br></div><div dir="auto">You probably already did all of this!</div><div dir="auto"><br></div><div dir="auto">-Forest</div></div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Wed, Mar 15, 2023, 10:04 PM Kevin Venzke <<a href="mailto:stepjak@yahoo.fr">stepjak@yahoo.fr</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hi Forest,<br>
<br>
Le lundi 13 mars 2023 à 14:00:46 UTC−5, Forest Simmons <<a href="mailto:forest.simmons21@gmail.com" target="_blank" rel="noreferrer">forest.simmons21@gmail.com</a>> a écrit :<br>
> Kevin,<br>
> <br>
> Here's what I had in mind:<br>
> <br>
> 1.Generate a random ballot profile.<br>
> <br>
> 2. If it has either a majority faction or a Condorcet cycle, discard it.<br>
> <br>
> 3. If there is a unilateral order reversal that creates a cycle, do one at random, and<br>
> check to see which Condorcet completion methods reward the reversal.<br>
> <br>
> increment the counters of success and failure.<br>
> <br>
> 4. Repeat ...<br>
> <br>
> Am I being too naïve ?<br>
<br>
This is basically what I do measure now, which I would call the "face value" burial<br>
incentive. If you insist on Condorcet and minimize this metric, it will lead you to<br>
Schwartz//IRV, or I guess a method of the sort that Kristofer looks for. And you won't want<br>
to use anything MinMax-like where you get to consider all the pairwise contests.<br>
<br>
However, I think it's possible to arrange things so that successful burial depends on<br>
getting lower preference support from voters who aren't that likely to be offering it. This<br>
is based on the theory that voters will naturally end their ranking somewhere between two<br>
frontrunners. So what I was thinking about is whether there could be a metric that<br>
represents this idea.<br>
<br>
Essentially you would concede that for some method, given totally random ballots, the<br>
burial incentive looks horrendous. But after accounting for expected voter behavior, burial<br>
mostly seems dangerous.<br>
<br>
> How much difference would it make to generate the profiles geometrically? Would it be<br>
> worth the extra trouble?<br>
<br>
That I'm not sure.<br>
<br>
Kevin<br>
<a href="http://votingmethods.net" rel="noreferrer noreferrer" target="_blank">votingmethods.net</a><br>
</blockquote></div>