Ranking in Tournaments and Group Decisionmaking

Stephen T. Goddard
Additional contact information
Stephen T. Goddard: General Electric Information Services Pty. Ltd., Melbourne, Australia

Management Science, 1983, vol. 29, issue 12, 1384-1392

Abstract: This paper fully discusses methods for ranking a set of alternatives in the fairest possible way according to a minimum violations criterion. New methods, based on finding paths and circuits in graphs, are presented for ranking participants in round-robin and generalized tournaments, and for consensus and group decisionmaking problems. The objective of the paper is to review existing methods for tackling these problems, and compare them with the new methods, according to a "fairness" criterion, and the amount of computing required to reach a solution. It is shown that the new methods often exceed the existing methods in both fairness and reduced computing requirements. In particular, the new methods are generally more versatile than existing methods. This allows organizations to obtain the fairest ranking of a number of alternatives, according to their managers' or employees' wishes. Particular attention is given to incomplete rankings where insufficient exposure of an individual to some alternatives restricts that individual to ranking only the remaining alternatives.

Keywords: tournament rankings; decision making (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.12.1384 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:29:y:1983:i:12:p:1384-1392

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().