Corpus ID: 8825075

How I won the "Chess Ratings - Elo vs the Rest of the World" Competition

  title={How I won the "Chess Ratings - Elo vs the Rest of the World" Competition},
  author={Yannis Sismanis},
This article discusses in detail the rating system that won the kaggle competition “Chess Ratings: Elo vs the rest of the world”. The competition provided a historical dataset of outcomes for chess games, and aimed to discover whether novel approaches can predict the outcomes of future games, more accurately than the well-known Elo rating system. The winning rating system, called Elo++ in the rest of the article, builds upon the Elo rating system. Like Elo, Elo++ uses a single rating per player… Expand
Originally designed as a way to reflect past performance, chess ratings are now widely used to reflect players strength with many important aspects in tournament scheduling, advertising and premiumExpand
Determining Baseball Performance Quality with an Elo Rating Mac Bagwell June 12 , 2019
Recent advances in data collection for MLB games has made quantitative analysis of individual player performance simultaneously easier and richer. However, these advances have been limited to MLBExpand
Prediction of the outcome of a Twenty-20 Cricket Match
Twenty20 cricket, sometimes written Twenty-20, and often abbreviated to T20, is a short form of cricket. In a Twenty20 game the two teams of 11 players have a single innings each, which is restrictedExpand
The efficacy of league formats in ranking teams
A new approach for estimating attacking and defensive strengths based on the Poisson regression for modelling match outcomes is proposed and it turns out that a two-stage league format is the most efficacious setting and can be enhanced by setting the number of points allocated for a win to two. Expand
The predictive power of ranking systems in association football
An overview and comparison of predictive capabilities of several methods for ranking association football teams and the best performing algorithm is a version of the famous Elo rating system that originates from chess player ratings, but several other methods provide better predictive performance than the official ranking method. Expand
The Network HHD: Quantifying Cyclic Competition in Trait-Performance Models of Tournaments
Competitive tournaments appear in sports, politics, population ecology, and animal behavior. All of these fields have developed methods for rating competitors and ranking them accordingly. AExpand
Balancing Zero-Sum Games with One Variable per Strategy
A game-theoretic approach that automatically balances strategies based on a mathematical model of the game, modifying a zero-sum game, using one variable per strategy, so that every strategy has an incentive to be employed. Expand
Two Algorithms Under Stochastic Gradient Descent Framework for Recommender Systems
Optimization of the most important regulation parameters, such as numbers of factors, learning and regularization rates, numbers of global iterations, are considered in this paper based on the Grockit and Chess data. Expand
A Margin-based MLE for Crowdsourced Partial Ranking
This paper proposes a novel framework to learn some probabilistic models of partial orders as a margin-based Maximum Likelihood Estimate (MLE) method, and proves that the induced MLE is a joint convex optimization problem with respect to all the parameters, including the global ranking scores and margin parameter. Expand
Interpretable sports team rating models based on the gradient descent algorithm
Several new sports team rating models based on the gradient descent algorithm are introduced, and are inspired by the prominent Elo rating system, and yields an iterative version of ordinal logistic regression, as well as different variants of Poisson regression-based models. Expand


Introduction to Stochastic Search and Optimization
A survey of the range of topics, in a strong, interdisciplinary format that will appeal to both students and researchers. Expand
A Limited Memory Algorithm for Bound Constrained Optimization
An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited memory BFGS matrix to approximate theExpand
Chess Rating Systems
  • Chess Rating Systems
Kaggle Contest: Chess Ratings ELO vs the World
  • Kaggle Contest: Chess Ratings ELO vs the World
Kaggle Contest: Chess Ratings — Elo vs the Rest of the World
  • Kaggle Contest: Chess Ratings — Elo vs the Rest of the World