Information for "Balinski–Young theorem"

Jump to navigation Jump to search

Basic information

Display titleBalinski–Young theorem
Default sort keyBalinski–Young theorem
Page length (in bytes)4,637
Page ID1554
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 creatorDr. Edmonds (talk | contribs)
Date of page creation00:18, 26 January 2020
Latest editorDr. Edmonds (talk | contribs)
Date of latest edit17:07, 13 July 2021
Total number of edits9
Total number of distinct authors2
Recent number of edits (within past 180 days)1
Recent number of distinct authors1

Page properties

Transcluded templates (13)

Templates used on this page:

Page transcluded on (1)

Template used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In 1983, two mathematicians, Michel Balinski and Peyton Young, proved that any method of apportionment will result in paradoxes whenever there are three or more parties (or states, regions, etc.).[1][2] The theorem shows that any possible method used to allocate the remaining fraction will necessarily fail to always follow quota. More precisely, their theorem states that there is no apportionment system that has the following 3 properties [3] (as the example we take the division of seats between parties in a system of proportional representation):
Information from Extension:WikiSEO