Information for "Beat-the-plurality-winner method"

Basic information

Display titleBeat-the-plurality-winner method
Default sort keyBeat-the-plurality-winner method
Page length (in bytes)1,794
Page ID45
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 creatorimported>KVenzke
Date of page creation16:32, 21 February 2012
Latest editorRobLa (talk | contribs)
Date of latest edit05:15, 9 May 2022
Total number of edits17
Total number of distinct authors7
Recent number of edits (within past 180 days)8
Recent number of distinct authors2

Page properties

Transcluded templates (10)

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.
The "beat-the-plurality-winner method" (or "BPW method") is a Condorcet completion method invented and studied by Eivind Stensholt as an attempt to reduce burial incentive.[1] It is mainly described for the case of three candidates. In the absence of a Condorcet winner, one elects the candidate who defeats the first-past-the-post winner pairwise.
Information from Extension:WikiSEO