Uncovered set

Revision as of 21:53, 16 February 2005 by imported>DanKeshet (from markus and bruce's emails)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The uncovered set is defined for a set of rank-order preferences. Usually, the uncovered set is defined only for situations without pairwise ties. When there are no pairwise ties, then the uncovered set is identical to the set called Fishburn winners:

Select the candidate or candidates that are not Fishburn losers. A candidate i is a Fishburn loser if there is some other candidate j such that every candidate that pairwise beats j also pairwise beats i and there is at least one candidate that pairwise beats i but does not pairwise beat j.