Skip to main content
SpringerLink
Log in

Ranking participants in generalized tournaments

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

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].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, Ames, IA, 50011, USA

    Giora Slutzki

  2. Department of Economics, Iowa State University, Ames, IA, 50011, USA

    Oscar Volij

  3. Ben-Gurion University, Beer-Sheva, Israel

    Oscar Volij

Authors
  1. Giora Slutzki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oscar Volij
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oscar Volij.

Additional information

Received: January 2005

Rights and permissions

Reprints and permissions

About this article

Cite this article

Slutzki, G., Volij, O. Ranking participants in generalized tournaments. Int J Game Theory 33, 255–270 (2005). https://doi.org/10.1007/s00182-005-0197-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00182-005-0197-5

Keywords

Search

Navigation