| Display title | Balinski–Young theorem |
| Default sort key | Balinski–Young theorem |
| Page length (in bytes) | 5,232 |
| Namespace ID | 0 |
| Page ID | 1554 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| 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 | Dr. Edmonds (talk | contribs) |
| Date of page creation | 00:18, 26 January 2020 |
| Latest editor | Closed Limelike Curves (talk | contribs) |
| Date of latest edit | 04:21, 20 February 2024 |
| Total number of edits | 13 |
| Recent number of edits (within past 180 days) | 2 |
| Recent number of distinct authors | 2 |
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 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] |