A New Ranking Algorithm for A Round-Robin Tournament

α
Raghad Rowaida
Raghad Rowaida
σ
Afsana Ahmed Munia
Afsana Ahmed Munia
α Ahsanullah University of Science and Technology Ahsanullah University of Science and Technology

Send Message

To: Author

A New Ranking Algorithm for A Round-Robin Tournament

Article Fingerprint

ReserarchID

XBK39

A New Ranking Algorithm for A Round-Robin Tournament Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

The problem of ranking players in a round-robin tournament, in which outcome of any match is a win or a loss, is to rank players according to their performances in the tournament. In this paper, we have improved previously developed MST (Majority Spanning Tree) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. We have compared the performance of our algorithm with the MST algorithm and GIK algorithm.

References

6 Cites in Article
  1. Iqbal Ali,Wade Cook,Moshe Kress (1986). On the Minimum Violations Ranking of a Tournament.
  2. Q Mohammad Kaykobad,A Ahmed,Rezwan-Al Shafiqul Khalid,Bakhtiar (1995). A New Algorithm for Ranking Players of a Round Robin Tournament.
  3. S Poljak,V Rodl,J Spencer (1988). Tournament ranking with expected profit in polynomial time.
  4. S Poljak,A Czygrinowy,V Rodl Constructive quasi-ramsey numbers and tournament ranking.
  5. Stephen Goddard (1983). Ranking in Tournaments and Group Decisionmaking.
  6. Wade Cook,Igal Golan,Moshe Kress (1988). Heuristics for ranking players in a round robin tournament.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Raghad Rowaida. 2017. \u201cA New Ranking Algorithm for A Round-Robin Tournament\u201d. Global Journal of Computer Science and Technology - G: Interdisciplinary GJCST-G Volume 17 (GJCST Volume 17 Issue G2): .

Download Citation

Issue Cover
GJCST Volume 17 Issue G2
Pg. 31- 33
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-G Classification: I.1.2, G.1.2
Version of record

v1.2

Issue date

November 20, 2017

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 6254
Total Downloads: 1550
2026 Trends
Related Research

Published Article

The problem of ranking players in a round-robin tournament, in which outcome of any match is a win or a loss, is to rank players according to their performances in the tournament. In this paper, we have improved previously developed MST (Majority Spanning Tree) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. We have compared the performance of our algorithm with the MST algorithm and GIK algorithm.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A New Ranking Algorithm for A Round-Robin Tournament

Raghad Rowaida
Raghad Rowaida Ahsanullah University of Science and Technology
Afsana Ahmed Munia
Afsana Ahmed Munia

Research Journals