SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2607.22221 · 2026

Convergence analysis of a family of Zermelo-type iterations for the Bradley-Terry model

Yiming Xu, Ruijian Han, Ding Lu

arXiv · PDF

Code that ran

3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2607.22221.json · badge: /api/ran/2607.22221.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
Yiminithere/newman-algorithm-for-BT canonical (classifier label)
classifier basis: census
3 ran · 0 no recorded run
FunctionStatusWhere it lives
centering Ran
ran, violated the contract we drafted
Yiminithere/newman-algorithm-for-BT/utils.py
pointer only (licence: NOASSERTION) · get_code("99e08c9611171a34")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Yiminithere/newman-algorithm-for-BT (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_jacobian Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
Yiminithere/newman-algorithm-for-BT/utils.py
pointer only (licence: NOASSERTION) · get_code("af32b604a280b0fd")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Yiminithere/newman-algorithm-for-BT (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_original_J Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
Yiminithere/newman-algorithm-for-BT/utils.py
pointer only (licence: NOASSERTION) · get_code("3314562fcbe574b6")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Yiminithere/newman-algorithm-for-BT (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Zermelo's algorithm is a classical method for computing the maximum likelihood estimator in the Bradley-Terry (BT) model, but its convergence can be slow in practice. To accelerate computation, Newman introduced a family of Zermelo-type fixed-point iterations parameterized by α, with Zermelo's algorithm recovered at α = 1. Empirical evidence suggests that the choice α = 0 often converges substantially faster, making it a promising alternative, yet the mechanism underlying this acceleration remains elusive. This paper provides theoretical insight into this phenomenon through a systematic local convergence analysis. We derive closed-form expressions for local convergence factors under synchronous and asynchronous updates and analyze their dependence on α via spectral analysis of the associated Jacobian matrices. For synchronous updates, we show that the algorithm may fail to converge when α < 1, and its local convergence factor is quasi-convex in α under the population BT model. In contrast, asynchronous updates are always locally convergent, and their local convergence factor is provably monotonically increasing in α under the population BT model of consistently ordered bipartite comparison graphs, establishing the optimality of α = 0 in this setting. We further establish asymptotic approximation results for the population convergence factors under the BT model, justifying their practical relevance. Numerical experiments on synthetic and real-world datasets confirm the theory. Our analysis complements existing convergence results and shows that the acceleration of α = 0 arises not only from the parameter choice but, more importantly, from the use of asynchronous updates.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2607.22221")
get_code_for_paper("2607.22221")
have("2607.22221")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2607.22221.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2607.22221.svg)](https://syntology.ai/paper/2607.22221)

Connect an agent — have() is free.