Display title | Condorcet paradox |
Default sort key | Condorcet paradox |
Page length (in bytes) | 8,946 |
Page ID | 480 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 3 |
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 | imported>WikipediaBot |
Date of page creation | 20:55, 26 January 2005 |
Latest editor | Kristomun (talk | contribs) |
Date of latest edit | 16:42, 13 January 2023 |
Total number of edits | 26 |
Total number of distinct authors | 7 |
Recent number of edits (within past 180 days) | 2 |
Recent number of distinct authors | 2 |
Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | The voting paradox, Condorcet paradox, or Condorcet cycle is when within a set of candidates, no one candidate is preferred by at least as many voters as all the... |