A3 Refereed book chapter or chapter in a compilation book

Reflections on two old Condorcet extensions




AuthorsNurmi Hannu

EditorsNguyen, N.T., Kowalczyk, R., Mercik, J., Motylska-Kuźma, A.

Publishing placeCham

Publication year2018

Book title Transactions on Computational Collective Intelligence XXXI

Series titleLecture Notes in Computer Science

Number in series11290

First page 9

Last page21

Number of pages13

ISBN978-3-662-58463-7

eISBN978-3-662-58464-4

ISSN2190-9288

DOIhttps://doi.org/10.1007/978-3-030-02889-3_2(external)


Abstract

The distinction -- in fact, rivalry -- between two intuitive notions about what constitutes the winning candidates or policy alternatives has been present in the social choice literature from its Golden Age, i.e. in the late 18'th century \cite{McLean and Urken 1995}. According to one of them, the winners can be distinguished by looking a the performance of candidates in one-on-one, that is, pairwise contests. According to the other, the winners are in general best situated in the evaluators' rankings over all candidates. The best known class of rules among those conforming to the first intuitive notion are those that always elect the Condorcet winner whenever one exists. These rules are called Condorcet extensions for the obvious reason that they extend Condorcet's well-known winner criterion beyond the domain where it can be directly applied. A candidate is a Condorcet winner whenever it defeats all other candidates in pairwise contests with a majority of votes. Condorcet extensions specify winners in all settings including those where a Condorcet winner is not to be found. Of course, in those settings where there is a Condorcet winner they all end up with electing it.Two such extensions are discussed in  detail: Dodgson's and Nanson's rules. 



Last updated on 2024-26-11 at 16:31