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

DOI10.4153/CMB-1964-015-1zbMATH Open0123.37702OpenAlexW2320232555MaRDI QIDQ5736664FDOQ5736664

Dale H. Bent, T. V. Narayana

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)

• Condition for a tournament score sequence to be simple
• On the asymptotic number of tournament score sequences
• Ranking players in multiple tournaments
• Title not available (Why is that?)
• An algorithm for generating partitions and its applications
• Counting tournament score sequences
• Some asymptotic formulas for lattice paths
• An algorithm to generate tournament score sequences

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)