[EM] Typo in GEDRP definition. Fixing HDRP.

[Michael Ossipoff]

Here' what  meant to say, in the Greater-&-Equal Deterministic RP (GEDRP)
definition that I posted earlier today:

GEDRP:

A defeat, D, is a discarded defeat if it contradicts a set of defeats that
includes a not-discarded defeat stronger than D, and no defeats weaker than
D.

[end f GEDRP definition]

By leaving cycles unsolved, GEDRP loses important properties.

Here is a (at least somewhat) fixed Hierarchial Deterministic Ranked-Pairs
(HDRP). Its first paragraph is identical to GEDRP:

HDRP:

1. A defeat, D, is a discarded defeat if it contradicts a set of defeats
that includes a not-discarded defeat that is sronger than D ,and no defeeat
that is weaker than D.

2. Additionally, a defeat, D, is a discarded defeat if it contradicts a set
of defeats each of which is 1) equal to D; and 2) not declared discarded in
paragraph 1.

[end of HDRP definition]

That defines what I mean by HDRP. It doesn't lose desirable properties by
leaving cycles unsolved. And it might avoid Markus' criticsm, because it
preferentially discards defeats that contradict sets containing a stronger
defeat.

But MAM is the Ranked-Pairs version that I recommend, because it simply
;and optimally avoids equal-defeats problems by its dominance order
effectively making equal defeats into unequal defeats.

I'll repeat my MAM definition:

A defeat, D, is a discarded defeat if it contradicts a set of not-discarded
defeats each of which is either 1) stronger than D; or 2) equal to D and
higher than D in the dominance order.

[end of MAM definition]

Michael Ossipoff
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20131221/a0e7ec8b/attachment-0002.htm>