Information for "Balinski–Young theorem"

Basic information

Display titleBalinski–Young theorem
Default sort keyBalinski–Young theorem
Page length (in bytes)5,232
Namespace ID0
Page ID1554
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
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 editorClosed Limelike Curves (talk | contribs)
Date of latest edit04:21, 20 February 2024
Total number of edits13
Recent number of edits (within past 180 days)2
Recent number of distinct authors2

Page properties

Transcluded templates (13)

Templates used on this page:

SEO properties



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 apportionment method will result in paradoxes for three or more parties (or states).[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 with the following properties for all house sizes:[3]
Information from Extension:WikiSEO