Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a22104430fd43e6e

Jump to content

Black's method

From Wikipedia, the free encyclopedia

Black's method is an election method proposed by Duncan Black in 1958 as a compromise between the Condorcet method and the Borda count. This method selects a Condorcet winner. If a Condorcet winner does not exist, then the candidate with the highest Borda score is selected.[1]

Properties

[edit]

Among methods satisfying the majority criterion, Black's method gives the minimum power to the majority and hence the method is best at protecting minorities.[2]

Satisfied criteria

[edit]

Black's method satisfies the following criteria:

Failed criteria

[edit]

Black's method does not satisfy the following criteria:

References

[edit]
  1. Black, Duncan (1958). The theory of committees and elections. Cambridge: University Press.
  2. 1 2 Kondratev, Aleksei Y.; Nesterov, Alexander S. (2020). "Measuring Majority Power and Veto Power of Voting Rules". Public Choice. 183 (1–2): 187–210. arXiv:1811.06739. doi:10.1007/s11127-019-00697-1. S2CID 53670198.
  3. 1 2 3 4 5 6 7 8 Felsenthal, Dan S; Nurmi, Hannu (2018). Voting procedures for electing a single candidate : proving their (in)vulnerability to various voting paradoxes. Cham, Switzerland: Springer. ISBN 978-3-319-74033-1.