Another measure of logical complexity of a method is the number of alternations between quantifier types, from universal to existential and back, in the complete definition of the winner. For example MinMax is more complex in this regard than DMC, because the MinMax winner is the candidate C such that for every candidate X and every candidate Z, there exists a candidate Y such that Y defeats X more strongly than Z defeats C. The alternation of min and max corresponds to an alternation of quantifier types. The DMC winner can be decscribed logically without this alternation of quantifiers. Forest
<<winmail.dat>>
---- Election-methods mailing list - see http://electorama.com/em for list info
