Robust bounds on choosing from large tournaments
Tournament solutions provide methods for selecting the “best” alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all...
Main Authors: | Saile, C, Suksompong, W |
---|---|
Format: | Journal article |
Published: |
Springer
2018
|
Similar Items
-
On the structure of stable tournament solutions
by: Brandt, F, et al.
Published: (2016) -
Refining tournament solutions via margin of victory
by: Brill, M, et al.
Published: (2020) -
Who can win a single-elimination tournament?
by: Kim, M, et al.
Published: (2017) -
Who Can Win a Single-Elimination Tournament?
by: Kim, Michael P., et al.
Published: (2020) -
The minimal covering set in large tournaments
by: Scott, A, et al.
Published: (2012)