The paper explores the problem of how high a player's Elo rating can be maximized through rigging games, given n players and a total of k games played.
The key insights are:
For n = 2 players, the highest achievable rating is bounded by a function of the pot function σ used in the Elo system. Specifically, the highest rating is Θ(f^-1(2k)), where f is defined in terms of σ.
For n > 2 players, there is a phase transition at n = k^(1/3). For n = Ω(k^(1/3)), the highest achievable rating is Θ(k^(1/3)), with the exact constant depending on the pot function σ. For n = o(k^(1/3)), the highest rating is Θ(n).
The paper provides both lower and upper bounds on the highest achievable rating for general n and k. The tightness of the bounds depends on the specific pot function σ used.
The key quantity governing the bounds is the left-tail behavior of the pot function σ, as captured by the function f defined in the paper.
他の言語に翻訳
原文コンテンツから
arxiv.org
深掘り質問