Revision as of 16:25, 27 September 2021 (view source) Marcosb (talk \| contribs) No edit summary ← Older edit		Revision as of 21:06, 14 October 2021 (view source) Kristomun (talk \| contribs) No edit summary Newer edit →
Line 145: --[[User:Marcosb\|Marcosb]] ([[User talk:Marcosb\|talk]]) 16:25, 27 September 2021 (UTC) ::: The easiest way to do it is probably just to try a lot of elections. First create a random (3-candidate) election with some voters using truncated ballots, note who wins, fill in those truncated ballots randomly one by one, and then checking if at any point a LNH failure occurs. ::: Let's say that the voter's ballot is A>B before and A>B>C after. If A or B won before and now C wins, that's LNHarm failure. If C won before but A or B wins after, that's LNHelp failure. You could try to devise a crafty mathematical proof, but with simple criteria like these, brute force is easier. [[User:Kristomun\|Kristomun]] ([[User talk:Kristomun\|talk]]) 21:05, 14 October 2021 (UTC) == Arrow/IIA ==

Talk:IRV Prime (view source)