| Display title | Gibbard's theorem |
| Default sort key | Gibbard's theorem |
| Page length (in bytes) | 2,316 |
| Namespace ID | 0 |
| Page ID | 2255 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| 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 | Psephomancy (talk | contribs) |
| Date of page creation | 03:45, 16 April 2020 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 10:57, 4 February 2024 |
| Total number of edits | 5 |
| Recent number of edits (within past 180 days) | 1 |
| Recent number of distinct authors | 1 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In 1973, Allan Gibbard published a paper which has since beome known as "Gibbard's theorem".[1] This theorem has proven useful in the fields of electoral system design and social choice theory. It states that for any deterministic process of collective decision, at least one of the following three properties must hold: |
