Dynamic Ranking and Translation Synchronization. (arXiv:2207.01455v1 [math.ST])

In many applications, such as sport tournaments or recommendation systems, we
have at our disposal data consisting of pairwise comparisons between a set of
$n$ items (or players). The objective is to use this data to infer the latent
strength of each item and/or their ranking. Existing results for this problem
predominantly focus on the setting consisting of a single comparison graph $G$.
However, there exist scenarios (e.g., sports tournaments) where the the
pairwise comparison data evolves with time. Theoretical …

arxiv math ranking synchronization translation