Assignments of weak orders to complete binary relations are considered. Firstly, it is shown that assigning the transitive closure of a complete binary relation does not always assign the closest weak order according to any reasonable metric on complete binary relations. It is then shown that...

The purpose of this note is to shed some light on the relationship between the Copeland rule and the Condorcet principle in those cases where there does not exist a Condorcet winner. It will be shown that the Copeland rule ranks alternatives according to their distances to being a Condorcet...