Unrestricted domain: Difference between revisions

The Universality criterion is part of the proof of [[Arrow's impossiblility theorem]], which states that a system gives unique results for a given set of ranked ballots. This is such a basic criterion that it is 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 this criterionuniversality. This is why some rated systems, such as [[MCA|MCA-P]], can appear to violate Arrow's theorem by satisfying all of the more-interesting criteria which,in alongArrow's withtheorem. UniversalityWithout universality, hethose provedother tocriteria are benot incompatible.