Condorcet choice correspondences for weak tournaments

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 which ties are possible. Received: 12 November 1996/Accepted: 4 November 1997