IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i6p2507-2525.html
   My bibliography  Save this article

How Should We Score Athletes and Candidates: Geometric Scoring Rules

Author

Listed:
  • Aleksei Y. Kondratev

    (HSE University, St. Petersburg 190121, Russia)

  • Egor Ianovski

    (HSE University, St. Petersburg 190121, Russia)

  • Alexander S. Nesterov

    (HSE University, St. Petersburg 190121, Russia)

Abstract

Scoring rules are widely used to rank athletes in sports and candidates in elections. Each position in each individual ranking is worth a certain number of points; the total sum of points determines the aggregate ranking. The question is how to choose a scoring rule for a specific application. First, we derive a one-parameter family with geometric scores that satisfies two principles of independence: once an extremely strong or weak candidate is removed, the aggregate ranking ought to remain intact. This family includes Borda count, generalized plurality (medal count), and generalized antiplurality (threshold rule) as edge cases, and we find which additional axioms characterize these rules. Second, we introduce a one-parameter family with optimal scores: the athletes should be ranked according to their expected overall quality. Finally, using historical data from biathlon, golf, and athletics, we demonstrate how the geometric and optimal scores can simplify the selection of suitable scoring rules, show that these scores closely resemble the actual scores used by the organizers, and provide an explanation for empirical phenomena observed in biathlon and golf tournaments. We see that geometric scores approximate the optimal scores well in events in which the distribution of athletes’ performances is roughly uniform.

Suggested Citation

  • Aleksei Y. Kondratev & Egor Ianovski & Alexander S. Nesterov, 2024. "How Should We Score Athletes and Candidates: Geometric Scoring Rules," Operations Research, INFORMS, vol. 72(6), pages 2507-2525, November.
  • Handle: RePEc:inm:oropre:v:72:y:2024:i:6:p:2507-2525
    DOI: 10.1287/opre.2023.2473
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.2473
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2023.2473?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:oropre:v:72:y:2024:i:6:p:2507-2525. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.