Ranking participants in generalized tournaments

Giora Slutzki; Oscar Volij

doi:10.1007/s00182-005-0197-5

Ranking participants in generalized tournaments

Giora Slutzki, Oscar Volij

Department of Economics

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

Abstract

Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pullman [14].

Original language	English
Pages (from-to)	255-270
Number of pages	16
Journal	International Journal of Game Theory
Volume	33
Issue number	2
DOIs	https://doi.org/10.1007/s00182-005-0197-5
State	Published - 1 Jun 2005

Keywords

Birkhoff's theorem
Perron-Frobenius theorem
Ranking and scoring methods
Tournaments

ASJC Scopus subject areas

Statistics and Probability
Mathematics (miscellaneous)
Social Sciences (miscellaneous)
Economics and Econometrics
Statistics, Probability and Uncertainty

Access to Document

10.1007/s00182-005-0197-5

Cite this

@article{cf047a22ec254339ab59fd450565499b,

title = "Ranking participants in generalized tournaments",

abstract = "Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pullman [14].",

keywords = "Birkhoff's theorem, Perron-Frobenius theorem, Ranking and scoring methods, Tournaments",

author = "Giora Slutzki and Oscar Volij",

year = "2005",

month = jun,

day = "1",

doi = "10.1007/s00182-005-0197-5",

language = "English",

volume = "33",

pages = "255--270",

journal = "International Journal of Game Theory",

issn = "0020-7276",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - Ranking participants in generalized tournaments

AU - Slutzki, Giora

AU - Volij, Oscar

PY - 2005/6/1

Y1 - 2005/6/1

N2 - Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pullman [14].

AB - Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pullman [14].

KW - Birkhoff's theorem

KW - Perron-Frobenius theorem

KW - Ranking and scoring methods

KW - Tournaments

UR - http://www.scopus.com/inward/record.url?scp=33644526601&partnerID=8YFLogxK

U2 - 10.1007/s00182-005-0197-5

DO - 10.1007/s00182-005-0197-5

M3 - Article

AN - SCOPUS:33644526601

SN - 0020-7276

VL - 33

SP - 255

EP - 270

JO - International Journal of Game Theory

JF - International Journal of Game Theory

IS - 2

ER -

Ranking participants in generalized tournaments

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this