IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2407.13845.html
   My bibliography  Save this paper

Multi-Tier Tournaments: Matching and Scoring Players

Author

Listed:
  • Steven J. Brams
  • Mehmet S. Ismail

Abstract

We introduce a novel system of matching and scoring players in tournaments, called Multi-Tier Tournaments, illustrated by chess and based on the following rules: 1. Players are divided into skill-based tiers, based on their Elo ratings. 2. Starting with one or more mini-tournaments of the least skilled players (Tier 1), the winner or winners -- after playing multiple opponents -- move to the next-higher tier. 3. The winners progress to a final tier of the best-performing players from lower tiers as well as players with the highest Elo ratings. 4. Performance in each tier is given by a player's Tournament Score (TS), which depends on his/her wins, losses, and draws (not on his/her Elo rating). Whereas a player's Elo rating determines in which mini-tournament he/she starts play, TS and its associated tie-breaking rules determine whether a player moves up to higher tiers and, in the final mini-tournament, wins the tournament. This combination of players' past Elo ratings and current TS's provides a fair and accurate measure of a player's standing among the players in the tournament. We apply a variation of Multi-Tier Tournaments to the top 20 active chess players in the world (as of February 2024). Using a dataset of 1209 head-to-head games, we illustrate the viability of giving lower-rated players the opportunity to progress and challenge higher-rated players. We also briefly discuss the application of Multi-Tier Tournaments to baseball, soccer, and other sports that emphasize physical rather than mental skills.

Suggested Citation

  • Steven J. Brams & Mehmet S. Ismail, 2024. "Multi-Tier Tournaments: Matching and Scoring Players," Papers 2407.13845, arXiv.org.
  • Handle: RePEc:arx:papers:2407.13845
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2407.13845
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2407.13845. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.