The Bradley-Terry condition is L₁-testable

From MaRDI portal
Publication:1699573




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 page was built for publication: The Bradley-Terry condition is \(L_1\)-testable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699573)