Beat-the-plurality-winner method: Difference between revisions
Content added Content deleted
No edit summary |
m (Make Stensholt citation into a formatted reference) |
||
| Line 1: | Line 1: | ||
'''BPW''' (for '''Beats Plurality Winner''') is a Condorcet completion method invented and studied by Eivind Stensholt as an attempt to reduce burial incentive. It is only defined for up to three candidates and doesn't have an obvious way of being expanded to more. In the absence of a CW, one elects the candidate who defeats the [[FPP]] winner pairwise. |
'''BPW''' (for '''Beats Plurality Winner''') is a Condorcet completion method invented and studied by Eivind Stensholt as an attempt to reduce burial incentive.<ref>{{Cite journal|last=Stensholt|first=Eivind|date=2008-06-12|title=Condorcet Methods - When, Why and How?|url=https://papers.ssrn.com/abstract=1145304|language=en|location=Rochester, NY}}</ref> It is only defined for up to three candidates and doesn't have an obvious way of being expanded to more. In the absence of a CW, one elects the candidate who defeats the [[FPP]] winner pairwise. |
||
[http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1145304 Condorcet Methods - When, Why and How? by Eivind Stensholt, 2008] |
|||
== Notes == |
== Notes == |
||
One could potentially extend BPW to all elections by 1) first eliminating everyone not in a particular set (i.e. the [[Smith set]]) before running BPW, and/or 2) using another voting method to reduce the number of candidates down to three. |
One could potentially extend BPW to all elections by 1) first eliminating everyone not in a particular set (i.e. the [[Smith set]]) before running BPW, and/or 2) using another voting method to reduce the number of candidates down to three. |
||
== References == |
|||
<references /> |
|||
[[Category:Single-winner voting methods]] |
[[Category:Single-winner voting methods]] |
||
[[Category:Condorcet methods]] |
[[Category:Condorcet methods]] |
||
Revision as of 17:37, 26 August 2020
BPW (for Beats Plurality Winner) is a Condorcet completion method invented and studied by Eivind Stensholt as an attempt to reduce burial incentive.[1] It is only defined for up to three candidates and doesn't have an obvious way of being expanded to more. In the absence of a CW, one elects the candidate who defeats the FPP winner pairwise.
Notes
One could potentially extend BPW to all elections by 1) first eliminating everyone not in a particular set (i.e. the Smith set) before running BPW, and/or 2) using another voting method to reduce the number of candidates down to three.
References
- ↑ Stensholt, Eivind (2008-06-12). "Condorcet Methods - When, Why and How?". Rochester, NY. Cite journal requires
|journal=(help)