[EM] Top Vote Path: Demonstration of resistant set and monotonicity being compatible

Kristofer Munsterhjelm km-elmet at munsterhjelm.no
Sun Aug 31 12:43:30 PDT 2025


About three weeks ago, I asked Kevin Venzke to check if he could find 
any monotonicity failures with my unnamed resistant set method.

He couldn't, so I'm reasonably sure that it does pass monotonicity. I've 
also given it the (preliminary?) name "Top Vote Path" because it uses a 
path of (sums of) top/first preferences to determine which candidates 
beat which others.

I wrote a Python implementation here: 
https://github.com/kristomu/voting-methods/tree/master/top_vote_path 
with test cases. Feel free to play with it or incorporate it into 
various simulators/etc :-)

It's a pretty complex method and may not be remarkable in its criterion 
compliance beyond from the two big ones: monotonicity and resistant set. 
But IMHO, those are pretty big ones.

-km


More information about the Election-Methods mailing list