1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
use super::util::{standard_logistic_cdf, Player, Rating, RatingSystem, TANH_MULTIPLIER};
use rayon::prelude::*;
#[derive(Debug)]
pub struct Glicko {
pub beta: f64,
pub sig_drift: f64,
}
impl Default for Glicko {
fn default() -> Self {
Self {
beta: 400. * TANH_MULTIPLIER / std::f64::consts::LN_10,
sig_drift: 35.,
}
}
}
impl Glicko {
fn win_probability(&self, sig_perf: f64, player: &Rating, foe: &Rating) -> f64 {
let z = (player.mu - foe.mu) / foe.sig.hypot(sig_perf);
standard_logistic_cdf(z)
}
}
impl RatingSystem for Glicko {
fn round_update(&self, contest_weight: f64, mut standings: Vec<(&mut Player, usize, usize)>) {
let sig_perf = self.beta / contest_weight.sqrt();
let all_ratings: Vec<(Rating, usize, f64)> = standings
.par_iter_mut()
.map(|(player, lo, _)| {
player.add_noise_and_collapse(self.sig_drift);
let g = 1f64.hypot(player.approx_posterior.sig / sig_perf).recip();
(player.approx_posterior, *lo, g)
})
.collect();
let gli_q = TANH_MULTIPLIER / sig_perf;
standings.into_par_iter().for_each(|(player, my_lo, _)| {
let my_rating = &player.approx_posterior;
let mut info = 0.;
let mut update = 0.;
for (rating, lo, g) in &all_ratings {
let outcome = match my_lo.cmp(lo) {
std::cmp::Ordering::Less => 1.,
std::cmp::Ordering::Equal => 0.5,
std::cmp::Ordering::Greater => 0.,
};
let probability = self.win_probability(sig_perf, my_rating, rating);
info += g * g * probability * (1. - probability);
update += g * (outcome - probability);
}
info = 0.25;
update /= all_ratings.len() as f64;
info *= gli_q * gli_q;
let sig = (my_rating.sig.powi(-2) + info).recip().sqrt();
update *= gli_q * sig * sig;
let mu = my_rating.mu + update;
player.update_rating(Rating { mu, sig }, 0.);
});
}
}