I'll start off with my prototype:
https://elegant-shaw-2cb49a.netlify.app/votevote
Anyone into electoral methods or game theory? If you've ever watched CGP Grey's videos on electoral methods or seen Nicky Case's *To Build a Better Ballot*,[1] it's very much in the spirit of that. It's mostly a toy that will run a single election in a large number of different electoral methods.
Currently I've implemented ~26 different electoral methods which is pretty neat. However, I've shied away from the methods that voting theory nerds love the most: Condorcet methods. I've implemented Copeland (although there's a mistake I haven't fixed yet) as well as Kemeny Young. However, Kemeny Young is implemented in the most brute force way possible and is O(n!) right now.
Mostly I think I'm just looking for people with a math/game-theory background that would be interested in helping out, but I'm open to anyone interested. I know there's a lot of optimizations I could make to the Kemeny Young algorithm, but I've been hesitant to do so because I can't find the right theorems to make sure certain assumptions are true. For example, I'm quite sure that a subset of weak Condorcet winners would be at the front of the winning path, but I haven't found a textbook that's stated this explicitly and it's been a long time since college so I'm kinda iffy on proving it to myself. I also don't think having to learn the proof everytime just to make sure my assumptions are mathematically sound is the best way to develop such a tool. Thanks
It's all open-source and won't have ads and will hopefully just be a static site so it's really just a hobby project.
[0] https://www.youtube.com/watch?v=s7tWHJfhiyo
[1] https://ncase.me/ballot/