2020
DOI: 10.48550/arxiv.2012.02657
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Margin of Victory in Tournaments: Structural and Experimental Results

Markus Brill,
Ulrike Schmidt-Kraepelin,
Warut Suksompong

Abstract: 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. Fur… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…In particular, even though the problem is computationally hard for MoV k-kings for any constant k ≥ 4 (Brill et al 2020b), there exists an efficient heuristic that correctly computes the MoV value in most cases. In the full version (Brill et al 2020a), we give an example showing that the heuristic is not always correct. More precisely, for any positive integer , we construct a tournament such that {MoV TC (x, T ) | x ∈ V (T )} contains the values 1, 2, .…”
Section: A Probabilistic Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…In particular, even though the problem is computationally hard for MoV k-kings for any constant k ≥ 4 (Brill et al 2020b), there exists an efficient heuristic that correctly computes the MoV value in most cases. In the full version (Brill et al 2020a), we give an example showing that the heuristic is not always correct. More precisely, for any positive integer , we construct a tournament such that {MoV TC (x, T ) | x ∈ V (T )} contains the values 1, 2, .…”
Section: A Probabilistic Resultsmentioning
confidence: 99%
“…For two representative stochastic models (uniform random and urn), Figure 2 depicts the average size of the set of alternatives with maximum MoV value, and Figure 3 shows the average number of unique MoV values. Results on the other four models (impartial culture, Mallows, and two variants of Condorcet noise) can be found in the full version (Brill et al 2020a).…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations