  This article aims to present a unified framework for grading-based voting
processes. The idea is to represent the grades of each voter on d candidates as
a point in R^d and to define the winner of the vote using the deepest point of
the scatter plot. The deepest point is obtained by the maximization of a depth
function. Universality, unanimity, and neutrality properties are proved to be
satisfied. Monotonicity and Independence to Irrelevant Alternatives are also
studied. It is shown that usual voting processes correspond to specific choices
of depth functions. Finally, some basic paradoxes are explored for these voting
processes.
