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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.