Dear Ted,
Jobst Heitzig wrote (12 Jan 2005):
> A set A is a covering set if each candidate x from outside
> A is covered in A+{x}. In other words, if for each x from
> outside A there is some y in A with y>x but no z in A
> with x>z>y. The minimal covering set is the intersection
> of all covering sets.
Situation #1:
(The defeats are sorted according to
their strengths in a decreasing order.)
D > A
A > B
B > C
C > A
C > D
B > D
Situation #2:
A > C
D > A
A > B
B > C
C > D
B > D
If I understand this definition correctly, then the Dutta
set is {A,B,C} in situation #1 and {A,B,D} in situation #2.
Therefore, Dutta//MinMax chooses candidate A in situation #1
and candidate D in situation #2 so that monotonicity is
violated.
Is everything correct?
Markus Schulze
----
Election-methods mailing list - see http://electorama.com/em for list info
