OpenAlex | The Bradley–Terry condition is <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-testable

The Bradley–Terry condition is L1-testable

Work

Year: 2017

Type: article

Source: Discrete Mathematics

Authors Agelos Georgakopoulos, Konstantinos Tyros

Institutions University of Warwick, Koç University

Cites: 14

Cited by:

Related to: 10

FWCI:

Citation percentile (by year/subfield):

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders Engineering and Physical Sciences Research Council, Engineering and Physical Sciences Research Council

Grant IDS EP/L002787/1, 639046