Maximum Constrained Approval Bucklin: Difference between revisions
Maximum Constrained Approval Bucklin (view source)
Revision as of 14:51, 22 January 2020
, 4 years agoFix date error
m (Add EM post dates, and links to free riding wiki page.) |
m (Fix date error) |
||
Line 7:
Determining which voters to eliminate to maximize the support of a candidate subject to earlier constraints is relatively simple to do by linear programming, but hard to do by hand; FAB can't be counted entirely by hand.
What ended up as FAB was initially proposed in 2017<ref>{{cite web|url=http://lists.electorama.com/pipermail/election-methods-electorama.com/2017-January/001276.html|title=Bucklin multiwinner method|website=Election-methods mailing list archives|date=2017-01-06}}</ref> and simplified in later that year<ref>{{cite web|url=http://lists.electorama.com/pipermail/election-methods-electorama.com/2017-September/001584.html|title=A simpler vote management-resistant Bucklin LP|website=Election-methods mailing list archives|date=2017-09-15}}</ref>. The method detailed here has been further modified from the EM posts to resist Woodall [[free riding]].
<<TBD, below this point, particularly the handling of epsilons>>
| |||