Given a tournament T, a Banks winner of T is the first vertex of any maximal (with respect to inclusion) transitive subtournament of T; a Copeland winner of T is a vertex with a maximum out-degree. In this paper, we show that 13 is the minimum number of vertices that a tournament must have so...

This paper presents the -linked- notions of metric and latticial medians and it explains what is the median procedure for the consensus problems, in particular in the case of the aggregation of linear orders. First we consider the medians of a v-tuple of arbitrary or particular binary...

Given a finite set X and a collection Π, called a profile, of binary relations defined on X (which can be linear orders, complete preorders, any relations, and so on), a relation R is said to be median if it minimizes the total number of disagreements with respect to Π. In the context of...