Computation of the Number of Score Sequences in Round-Robin Tournaments

DOI10.4153/CMB-1964-015-1MaRDI QIDQ5736664zbMATH OpenOpenAlexFDO

Authors T. V. Narayana, Dale H. Bent

Publication date 1964

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cmb-1964-015-1

zbMATH Keywords

operations research

Cited in

(8)

• Counting tournament score sequences
• Ranking players in multiple tournaments
• An algorithm to generate tournament score sequences
• An algorithm for generating partitions and its applications
• Some asymptotic formulas for lattice paths
• On the asymptotic number of tournament score sequences
• scientific article; zbMATH DE number 7732125 (Why is no real title available?)
• Condition for a tournament score sequence to be simple

This page was built for publication: Computation of the Number of Score Sequences in Round-Robin Tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5736664)