[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/bie/wpaper/520.html
   My bibliography  Save this paper

Probabilistic Transitivity in Sports

Author

Listed:
  • Tiwisina, Johannes

    (Center for Mathematical Economics, Bielefeld University)

  • Külpmann, Philipp

    (Center for Mathematical Economics, Bielefeld University)

Abstract
We seek to find the statistical model that most accurately describes empirically observed results in sports. The idea of a transitive relation concerning the team strengths is implemented by imposing a set of constraints on the outcome probabilities. We theoretically investigate the resulting optimization problem and draw comparisons to similar problems from the existing literature including the linear ordering problem and the isotonic regression problem. Our optimization problem turns out to be very complicated to solve. We propose a branch and bound algorithm for an exact solution and for larger sets of teams a heuristic method for quickly finding a „good“ solution. Finally we apply the described methods to panel data from soccer, American football and tennis and also use our framework to compare the performance of empirically applied ranking schemes.

Suggested Citation

  • Tiwisina, Johannes & Külpmann, Philipp, 2016. "Probabilistic Transitivity in Sports," Center for Mathematical Economics Working Papers 520, Center for Mathematical Economics, Bielefeld University.
    • Handle: RePEc:bie:wpaper:520
    as

    Download full text from publisher

    File URL: https://pub.uni-bielefeld.de/download/2901643/2902675
    File Function: First Version, 2014
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lim, Johan & Wang, Xinlei & Choi, Wanseok, 2009. "Maximum likelihood estimation of ordered multinomial probabilities by geometric programming," Computational Statistics & Data Analysis, Elsevier, vol. 53(4), pages 889-893, February.
    2. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Thierry Denœux & Marie-Hélène Masson, 2012. "Evidential reasoning in large partially ordered sets," Annals of Operations Research, Springer, vol. 195(1), pages 135-161, May.
    2. Rajeev Kohli & Khaled Boughanmi & Vikram Kohli, 2019. "Randomized Algorithms for Lexicographic Inference," Operations Research, INFORMS, vol. 67(2), pages 357-375, March.
    3. Olivier Hudry, 2015. "Complexity results for extensions of median orders to different types of remoteness," Annals of Operations Research, Springer, vol. 225(1), pages 111-123, February.
    4. Juan Aparicio & Mercedes Landete & Juan F. Monge, 2020. "A linear ordering problem of sets," Annals of Operations Research, Springer, vol. 288(1), pages 45-64, May.
    5. Labbé, Martine & Landete, Mercedes & Monge, Juan F., 2023. "Bilevel integer linear models for ranking items and sets," Operations Research Perspectives, Elsevier, vol. 10(C).
    6. Olivier Hudry & Bernard Monjardet, 2010. "Consensus theories: an oriented survey," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00504974, HAL.
    7. Jean-Paul Doignon & Kota Saito, 2022. "Adjacencies on random ordering polytopes and flow polytopes," Papers 2207.06925, arXiv.org.
    8. Gregorio Curello & Ludvig Sinander, 2023. "Agenda-Manipulation in Ranking," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 90(4), pages 1865-1892.
    9. Haruki Kono & Kota Saito & Alec Sandroni, 2023. "Axiomatization of Random Utility Model with Unobservable Alternatives," Papers 2302.03913, arXiv.org, revised Aug 2023.
    10. Hudry, Olivier, 2012. "On the computation of median linear orders, of median complete preorders and of median weak orders," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 2-10.
    11. Gregorio Curello & Ludvig Sinander, 2020. "Agenda-manipulation in ranking," Papers 2001.11341, arXiv.org, revised Sep 2022.
    12. S. S. Dabadghao & B. Vaziri, 2022. "The predictive power of popular sports ranking methods in the NFL, NBA, and NHL," Operational Research, Springer, vol. 22(3), pages 2767-2783, July.

    More about this item

    Keywords

    stochastic transitivity; trinomial; geometric optimization; ranking; branch and bound; linear ordering problem; elo; tabu search; football; soccer; tennis; bundesliga; nfl; atp;
    All these keywords.

    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:bie:wpaper:520. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Bettina Weingarten (email available below). General contact details of provider: https://edirc.repec.org/data/imbiede.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.