Abstract.
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: 12 November 1996/Accepted: 4 November 1997
Rights and permissions
About this article
Cite this article
Peris, J., Subiza, B. Condorcet choice correspondences for weak tournaments. Soc Choice Welfare 16, 217–231 (1999). https://doi.org/10.1007/s003550050141
Issue Date:
DOI: https://doi.org/10.1007/s003550050141