Tournaments are complete and asymmetric binary relations. This type of binary relation rules out the possibility of ties or indifferences which are quite common in other contexts. In this work we generalize, from a normative point of view, some important tournament solutions to the context in...

In this paper we analyze the explicit representation of fixed agenda social choice correspondences under different rationality assumptions (independence, Pareto optimality, etc.). It is well known that, under some of these assumptions, the existence of dictators, oligarchies or individuals with...

In this paper we analyze the relationship between social decision functions (SDF) and fixed agenda social choice correspondences (fixed agenda SCC), satisfying some rationality conditions (such as Pareto, Independence, Monotonicity, Neutrality or Anonimity), with the aim of translating known...