| Display title | Beat-the-plurality-winner method |
| Default sort key | Beat-the-plurality-winner method |
| Page length (in bytes) | 1,794 |
| Namespace ID | 0 |
| Page ID | 45 |
| 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) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>KVenzke |
| Date of page creation | 16:32, 21 February 2012 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 05:15, 9 May 2022 |
| Total number of edits | 17 |
| 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. | 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. |
