Publication: The bradley-terry condition is L-1-testable
Loading...
Program
KU-Authors
Organization Authors
Co-Authors
Georgakopoulos, Agelos
Date
Language
Type
Embargo Status
N/A
Journal Title
Journal ISSN
Volume Title
Alternative Title
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.
Source
Publisher
Elsevier
Subject
Citation
item.page.haspartof
Source
Discrete Mathematics
item.page.ispartofseries
item.page.edition
DOI
10.1016/j.disc.2017.10.026
item.page.datauri
item.page.link
Rights
N/A
Copyrights Note
Rights and licensing
N/A