| Display title | Uncovered set |
| Default sort key | Uncovered set |
| Page length (in bytes) | 18,307 |
| Namespace ID | 0 |
| Page ID | 459 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 4 |
| 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>DanKeshet |
| Date of page creation | 21:53, 16 February 2005 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 17:16, 8 April 2024 |
| Total number of edits | 34 |
| Recent number of edits (within past 180 days) | 6 |
| Recent number of distinct authors | 2 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The minimal uncovered set (sometimes referred to as the "Landau set" or "Fishburn set") is defined for a set of rank-order preferences, and generalizes the Condorcet winner (making it a kind of "top cycle"). The set contains all candidates on the "Pareto frontier" for pairwise-victories. |
