A new algorithm for ranking players of a round-robin tournament

DOI10.1016/0305-0548(94)E0024-2zbMath0814.90147MaRDI QIDQ1342337

Mohammad Kaykobad, Rezwan-al Bakhtiar, Q. N. U. Ahmed, A. T. M. Shafiqul Khalid

Publication date: 13 February 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

round-robin tournamentranking players

Mathematics Subject Classification ID

Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Majority spanning trees, cotrees and their applications ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An improved MST algorithm for ranking players of a round-robin tournament

Cites Work

• Ranking in Tournaments and Group Decisionmaking
• On the Minimum Violations Ranking of a Tournament
• Tournament Ranking with Expected Profit in Polynomial Time

This page was built for publication: A new algorithm for ranking players of a round-robin tournament