| Display title | Maximum Constrained Approval Bucklin |
| Default sort key | Maximum Constrained Approval Bucklin |
| Page length (in bytes) | 10,362 |
| Namespace ID | 0 |
| Page ID | 1542 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | Kristomun (talk | contribs) |
| Date of page creation | 00:13, 20 January 2020 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 10:43, 15 March 2022 |
| Total number of edits | 16 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
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. |
