| Display title | Binary independence condition |
| Default sort key | Binary independence condition |
| Page length (in bytes) | 650 |
| Namespace ID | 0 |
| Page ID | 55 |
| 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 | imported>Cymru |
| Date of page creation | 17:04, 25 September 2005 |
| Latest editor | Psephomancy (talk | contribs) |
| Date of latest edit | 02:32, 2 February 2019 |
| Total number of edits | 2 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Binary independence is a condition in Arrow's theorem.
A voting method F satisfies binary independence if and only if the
following condition holds; Let A and B be two candidates, and let p1 and p2 be
two profiles where each voter's preference for A vs. B in p1 agrees with her A vs. B
preference in p2. Then F gives the same A vs. B ranking for both p1 and p2. |
