Stronger players win more balanced knockout tournaments

DOI10.1007/BF01864157zbMath0666.62069MaRDI QIDQ1116595

Robert W. Chen, Frank K. Hwang

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

binary treepreference schemeknockout tournamentstrongly stochastic transitive

Mathematics Subject Classification ID

Game theory (91A99) Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15)

Related Items (2)

The efficacy of tournament designs ⋮ A new perspective on implementation by voting trees

Cites Work

• Unnamed Item
• Stronger players win more knockout tournaments in average
• New Concepts in Seeding Knockout Tournaments
• Stronger Players Need not Win More Knockout Tournaments
• Do Stronger Players Win More Knockout Tournaments?

This page was built for publication: Stronger players win more balanced knockout tournaments