Information for "Binary independence condition"

Basic information

Display titleBinary independence condition
Default sort keyBinary independence condition
Page length (in bytes)650
Namespace ID0
Page ID55
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Cymru
Date of page creation17:04, 25 September 2005
Latest editorPsephomancy (talk | contribs)
Date of latest edit02:32, 2 February 2019
Total number of edits2
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

SEO properties



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.
Information from Extension:WikiSEO