Information for "Universality criterion"

Jump to navigation Jump to search

Basic information

Display titleUniversality criterion
Default sort keyUniversality criterion
Page length (in bytes)883
Page ID461
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>Homunq
Date of page creation19:46, 18 October 2010
Latest editorPsephomancy (talk | contribs)
Date of latest edit16:02, 19 October 2019
Total number of edits8
Total number of distinct authors2
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded template (1)

Template used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
The Universality criterion requires that a system give unique results for a given set of ranked ballots. It was stated by Kenneth Arrow as part of his impossibility theorem, and it is such a basic criterion that it's satisfied by all non-random ranked systems. However, since it was defined by Kenneth Arrow before there had been theoretical analysis of rated voting systems, it does not apply to rated ballots, and so all rated systems technically violate universality. This is why some rated systems, such as MCA-P, can appear to violate Arrow's theorem by satisfying all of his more-interesting criteria such as monotonicity and independence of irrelevant alternatives. When not combined with (ranked) universality, those other criteria are not incompatible.
Information from Extension:WikiSEO