Condorcet choice functions and maximal elements
Datum der Publikation: 2003
Nummer: 40
Art: Arbeitsdokument
Zusammenfassung
Choice functions on tournaments always select the maximal element (Condorcet winner), provided they exist, but this property does not hold in the more general case of weak tournaments. In this paper we analyze the relationship between the usual choice functions and the set of maximal elements in weak tournaments. We introduce choice functions selecting maximal elements, whenever they exist. Moreover, we compare these choice functions with those that already exist in the literature.