The Copeland measure of Condorcet choice functions (Q1343145): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Jean-François Laslier / rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Revision as of 15:35, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Copeland measure of Condorcet choice functions |
scientific article |
Statements
The Copeland measure of Condorcet choice functions (English)
0 references
1 February 1995
0 references
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.
0 references
Copeland measure
0 references
tournaments
0 references
choice function
0 references
score
0 references