First implementation of ELO logic

This commit is contained in:
Jack Jackson 2024-03-03 19:18:06 -08:00
parent 6f0e7cd593
commit ac4bdd09b8
4 changed files with 59 additions and 0 deletions

5
app/elo/README.md Normal file
View File

@ -0,0 +1,5 @@
Implementation of an ELO-like algorithm.
(Yes, [this](https://github.com/sublee/elo/) exists, and a [more mathematical treatment](https://cs.stanford.edu/people/paulliu/files/www-2021-elor.pdf), but eh, a bit of self implementation doesn't hurt in a personal project)
Ref. [here](http://web.archive.org/web/20130308190719/http://elo.divergentinformatics.com/) for testing, and [here](http://sradack.blogspot.com/2008/06/elo-rating-system-multiple-players.html) for implementation.

1
app/elo/__init__.py Normal file
View File

@ -0,0 +1 @@
from .elo import rerank # noqa

35
app/elo/elo.py Normal file
View File

@ -0,0 +1,35 @@
from typing import Iterable
K_FACTOR = 10
BETA = 200
def rerank(ratings: Iterable[int], winning_player_idx: int) -> Iterable[int]:
expectations = _expectations(ratings)
return [
rating
+ (K_FACTOR * ((1 if winning_player_idx == idx else 0) - expectations[idx]))
for idx, rating in enumerate(ratings)
]
def _expectations(ratings: Iterable[int]) -> Iterable[int]:
return [
_calculate_expectation(rating, ratings[:idx] + ratings[idx + 1 :])
for idx, rating in enumerate(ratings)
]
def _calculate_expectation(rating: int, other_ratings: Iterable[int]) -> int:
return sum(
[_pairwise_expectation(rating, other_rating) for other_rating in other_ratings]
) / (float(len(other_ratings) + 1) * len(other_ratings) / 2)
def _pairwise_expectation(rating: int, other_rating: int) -> Iterable[int]:
"""
Gives the expected score of `rating` against `other_rating`
"""
diff = float(other_rating) - float(rating)
f_factor = 2 * BETA # rating disparity
return 1.0 / (1 + 10 ** (diff / f_factor))

18
tests/elo/test_elo.py Normal file
View File

@ -0,0 +1,18 @@
from typing import Iterable
from app.elo import rerank
def test():
# From https://github.com/sublee/elo/blob/master/elotests.py
assert _almost_equal(rerank([1200, 800], 1), [1190.909, 809.091])
# Couldn't find any test-cases for multiplayer games.
def _almost_equal(actual: Iterable, expected: Iterable) -> bool:
assert len(actual) == len(expected)
for f, s in zip(actual, expected):
if (s - f) > (0.00001 * f):
return False
else:
return True