Back to Search
Start Over
The Bradley–Terry condition is [formula omitted]-testable.
- Source :
-
Discrete Mathematics . Apr2018, Vol. 341 Issue 4, p1171-1177. 7p. - Publication Year :
- 2018
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 341
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 128043735
- Full Text :
- https://doi.org/10.1016/j.disc.2017.10.026