Knockout tournaments with diluted Bradley-Terry preference schemes

DOI10.1016/0378-3758(91)90063-KzbMath0728.62027WikidataQ127316100 ScholiaQ127316100MaRDI QIDQ805101

Zong-zhen Lin, Yi-Ching Yao, Frank K. Hwang

Publication date: 1991

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

rooted binary treesBradley-Terry schemeknockout tournament planspreference schemerandom assignment of players to terminal nodes

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Directed graphs (digraphs), tournaments (05C20)

Related Items

Adaptive paired comparison design

Cites Work

• Stronger Players Need not Win More Knockout Tournaments
• A Biometrics Invited Paper. Science, Statistics, and Paired Comparisons
• Do Stronger Players Win More Knockout Tournaments?
• Unnamed Item
• Unnamed Item

This page was built for publication: Knockout tournaments with diluted Bradley-Terry preference schemes