A refinement of the uncovered set in tournaments

Han, Weibin; Deemen, Adrian Van

doi:10.1007/s11238-018-9676-6

“…In order to select the "winners" of a tournament in a consistent manner, numerous methods-known as tournament solutions-have been proposed. Given the ubiquity of tournaments, it is hardly surprising that tournament solutions have drawn substantial interest from researchers in the past few decades (Laslier 1997;Woeginger 2003;Hudry 2009;Aziz et al 2015;Dey 2017;Brandt, Brill, and Harrenstein 2018;Han and van Deemen 2019).…”

Section: Introductionmentioning

confidence: 99%

Margin of Victory in Tournaments: Structural and Experimental Results

Brill

¹

,

Schmidt-Kraepelin

²

,

Suksompong

³

2021

AAAI

2

0

View full text Add to dashboard Cite

Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives. The recently studied notion of margin of victory (MoV) offers a general method for refining the winner set of any given tournament solution, thereby increasing the discriminative power of the solution. In this paper, we reveal a number of structural insights on the MoV by investigating fundamental properties such as monotonicity and consistency with respect to the covering relation. Furthermore, we provide experimental evidence on the extent to which the MoV notion refines winner sets in tournaments generated according to various stochastic models.

show abstract

“…In order to select the "winners" of a tournament in a consistent manner, numerous methods-known as tournament solutions-have been proposed. Given the ubiquity of tournaments, it is hardly surprising that tournament solutions have drawn substantial interest from researchers in the past few decades (Laslier 1997;Woeginger 2003;Hudry 2009;Aziz et al 2015;Dey 2017;Brandt, Brill, and Harrenstein 2018;Han and van Deemen 2019).…”

Section: Introductionmentioning

confidence: 99%

Margin of Victory in Tournaments: Structural and Experimental Results

Brill,

Schmidt-Kraepelin,

Suksompong

2020

Preprint

View full text Add to dashboard Cite

Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives. The recently studied notion of margin of victory (MoV) offers a general method for refining the winner set of any given tournament solution, thereby increasing the discriminative power of the solution. In this paper, we reveal a number of structural insights on the MoV by investigating fundamental properties such as monotonicity and consistency with respect to the covering relation. Furthermore, we provide experimental evidence on the extent to which the MoV notion refines winner sets in tournaments generated according to various stochastic models.

show abstract