Maximum Constrained Approval Bucklin: Difference between revisions
m
Linkify name
Psephomancy (talk | contribs) (Rename category) |
m (Linkify name) |
||
Line 1:
'''Maximum Constrained Approval Bucklin''' (MCAB) is a multiwinner method devised by [[Kristofer Munsterhjelm]], based on [[Bucklin voting]]. It uses linear optimization to calculate candidate support by assuming earlier surplus transfers were maximally favorable to the candidate in question, and thus reduces the strategic impact of lowering or raising a winning candidate on a ballot.
MCAB works in multiple rounds, each of which sets an implicit approval cutoff for every ballot. The first round considers first preferences as approved, the second round considers first and second preferences, and so on. For each round, the method evaluates every remaining unelected candidate. The unelected candidate with the greatest support is elected if his support is greater than a Droop quota, and a round may elect more than one candidate.
| |||