Condorcet choice correspondences for weak tournaments

  1. Begoña Subiza Martínez
  2. Josep Enric Peris Ferrando 1
  1. 1 Universitat d'Alacant
    info

    Universitat d'Alacant

    Alicante, España

    ROR https://ror.org/05t8bcz72

Revista:
Working papers = Documentos de trabajo: Serie AD

Año de publicación: 1997

Número: 5

Páginas: 1-48

Tipo: Documento de Trabajo

DIALNET GOOGLE SCHOLAR lock_openAcceso abierto editor

Resumen

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

Fuente de los datos: Dialnet