| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903086 | Discrete Mathematics | 2018 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Agelos Georgakopoulos, Konstantinos Tyros,