Information for "Minimax approval"

Jump to navigation Jump to search

Basic information

Display titleMinimax approval
Default sort keyMinimax approval
Page length (in bytes)1,994
Page ID1658
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
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 creation17:14, 6 February 2020
Latest editorKristomun (talk | contribs)
Date of latest edit17:15, 6 February 2020
Total number of edits2
Total number of distinct authors1
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (12)

Templates used on this page:

Page transcluded on (1)

Template used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
Minimax approval is a consensus Approval multiwinner method devised by Brams, Kilgour, and Sanver.[1] It elects the assembly that minimizes the Hamming distance to the voter with the greatest such distance. Here, the Hamming distance is the number of candidates who is either in the outcome or approved on the voter's ballot, but not both or neither.
Information from Extension:WikiSEO