[EM] Example with most different results

[Abel Stan]

I mostly did it semi-manually, just trying in excel to better understand
each (the first example, with Condorcet). I then checked it with one site,
probably when I changed something up because of that is when Bucklin
switched.
The second example case from just modifying the first one. I also thought
if I'd really get into it I'd just try random ones, but with certain
restrictions to make it faster. That's what I did when I did the same thing
for different PR apportionment formulas.

On 2024-05-25 17:05, Kevin Venzke wrote:
>
> > I really can't imagine how to make such scenarios without just running
> tons of
> > random scenarios until you find a good one. Is that what you did?
>
> I think you can do some of them with mixed integer programming. But it
> would be pretty cumbersome - just running tons of scenarios would be
> easier.
>
> (For instance, for Kemeny, you could enumerate every permutation with
> Kemeny first and then add constraints that the minimum Kendall tau
> distance of these must be less than every other permutation's Kendall tau.)
>
> Weighted positional methods are easy to do, at least :-)
>
> -km
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20240527/52bb8713/attachment.htm>