The Bradley--Terry condition is L₁--testable
classification
🧮 math.CO
keywords
algorithmbradley--terryapproximatedcannotcaseschainconditionconstant
read the original abstract
We provide an algorithm with constant running time that given a weighted tournament $T$, distinguishes with high probability of success between the cases that $T$ can be represented by a Bradley--Terry model, or cannot even be approximated by one. The same algorithm tests whether the corresponding Markov chain is reversible.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.