The Copeland measure of Condorcet choice functions
type: Item
instance of: scholarly article
title: The Copeland measure of Condorcet choice functions
zbMATH Open document ID: 0812.05024
DOI: 10.1016/0166-218X(94)90013-2
author: Gilbert Laffond
author: Michel Le Breton
author: Jean-François Laslier
published in: Discrete Applied Mathematics
publication date: 1995-02-01T00:00:00Z
review text: Consider the class of all (round-robin) tournaments \(T\). A choice function \(F(T)\) is a mapping that assigns a non-empty subset of the set of the vertices of \(T\) to each tournament \(T\); the members of \(F(T)\) are deemed to be the winners, or most dominant participants, of the tournament. The Copeland choice function \(C(T)\) consists of those vertices of \(T\) that have the largest score. The authors propose a measure for comparing an arbitrary choice function with the Copeland choice function; and they compute this measure for various familiar choice functions.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 716326
zbMATH Keywords: Copeland measure
zbMATH Keywords: tournaments
zbMATH Keywords: choice function
zbMATH Keywords: score
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Sophisticated voting outcomes and agenda control
cites work: Covering relations, closest orderings and Hamiltonian bypaths in tournaments
cites work: Q5650707
cites work: Covering sets and a new Condorcet choice correspondence
cites work: Condorcet Social Choice Functions
cites work: Slater's winners of a tournament may not be in the Banks set
cites work: Q5585195
cites work: Choosing from a tournament
cites work: Cyclic tournaments and cooperative majority voting: A solution
description: scientific article; zbMATH DE number 716326