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 common in different contexts. In this work we generalize, from a normative point of view, some important tournaments solutions (top cycle, uncovered set and minimal covering) to the context where ties are possible.
|Date of creation:||Feb 1997|
|Publication status:||Published by Ivie|
|Contact details of provider:|| Postal: C/ Guardia Civil, 22, Esc 2a, 1o, E-46020 VALENCIA|
Phone: +34 96 319 00 50
Fax: +34 96 319 00 55
Web page: http://www.ivie.es/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ivi:wpasad:1997-05. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Departamento de Edición)
If references are entirely missing, you can add them using this form.