Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Condorcet Domains: A Geometric Perspective
verfasst von : Donald G. Saari
Erschienen in: The Mathematics of Preference, Choice and Order
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
One of the several topics in which Fishburn (1997, 2002) has made basic contributions involves finding maximal Condorcet Domains. In this current paper, I introduce a geometric approach that identifies all such domains and, at least for four and five alternatives, captures Fishburn's clever alternating scheme (described below), which has advanced our understanding of the area.
To explain “Condorcet Domains” and why they are of interest, start with the fact that when making decisions by comparing pairs of alternatives with majority votes, the hope is to have decisive outcomes where one candidate always is victorious when compared with any other candidate. Such a candidate is called the
Condorcet winner
. The attractiveness of this notion, where someone beats everyone else in head-to-head comparisons, is why the Condorcet winner remains a central concept in voting theory. For a comprehensive, modern description of the Condorcet solution concept, see Gehrlein's recent book (2006).