Information for "Maximum Constrained Approval Bucklin"

Basic information

Display titleMaximum Constrained Approval Bucklin
Default sort keyMaximum Constrained Approval Bucklin
Page length (in bytes)10,362
Page ID1542
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page2
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorKristomun (talk | contribs)
Date of page creation00:13, 20 January 2020
Latest editorKristomun (talk | contribs)
Date of latest edit10:43, 15 March 2022
Total number of edits16
Total number of distinct authors2
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded template (1)

Template used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
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.
Information from Extension:WikiSEO