cs.LGOct 23, 2025

Capturing Intransitive Dominance in Tennis Forecasting: A Graph Neural Network Approach

Authors: Lawrence Clegg, John Cartlidge

Organizations: School of Engineering Mathematics and Technology, University of Bristol, Ada Lovelace Building, Tankard’s Close, Bristol, BS8 1TW, UK

Abstract

Intransitive player dominance, where player A beats B, B beats C, but C beats A, is common in competitive tennis. Yet, there are few known attempts to incorporate it within forecasting methods. We address this problem with a graph neural network approach that explicitly models these intransitive relationships through temporal directed graphs, with players as nodes and their historical match outcomes as directed edges. Our model (65.7% accuracy, 0.214 Brier score) forecasts competitively with established rating systems such as Weighted Elo. Although it does not improve on the baseline in unconditional accuracy, a forecast-encompassing test shows that it carries complementary information. A combined forecast significantly outperforms Weighted Elo, and there is some indication that the gain is larger on the intransitive matchups our model targets. A graph-based representation of player interactions thus captures a forecasting signal that transitive rating systems discard, even between players who share no common opponents.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Topological Data Analysis and Graph-Theoretic Approaches for Tennis Match Prediction

    Jul 26, 2026Jake Schwaderer, Alexander Bastien, Omid Khormali +3Sports AnalyticsSports Outcome Prediction

  2. Forecasting the Winner of a Live Tennis Match

    Sep 7, 2026Charles Xie, Aneesh MuppidiProbabilistic ForecastingSports Outcome Prediction

  3. Predicting Tennis Serve directions with Machine Learning

    Feb 26, 2026Ying Zhu, Ruthuparna NaikarNext-Action PredictionHuman Behavior Prediction