Ranking in Tournaments and Group Decisionmaking
AbstractThis 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 29 (1983)
Issue (Month): 12 (December)
tournament rankings; decision making;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Ngwenyama, Ojelanki K. & Bryson, Noel, 1999. "Eliciting and mapping qualitative preferences to numeric rankings in group decision making," European Journal of Operational Research, Elsevier, vol. 116(3), pages 487-497, August.
- Siraj, Sajid & Mikhailov, Ludmil & Keane, John, 2012. "A heuristic method to rectify intransitive judgments in pairwise comparison matrices," European Journal of Operational Research, Elsevier, vol. 216(2), pages 420-428.
- Mass A. & Bezembinder, T. & Wakker, P., 1996.
"On solving intansitivities in repeated pairwise choices,"
Mathematical Social Sciences,
Elsevier, vol. 31(1), pages 53-53, February.
- Maas, Arne & Bezembinder, Thom & Wakker, Peter, 1995. "On solving intransitivities in repeated pairwise choices," Mathematical Social Sciences, Elsevier, vol. 29(2), pages 83-101, April.
- Bryson, Noel & Mobolurin, Ayodele & Ngwenyama, Ojelanki, 1995. "Modelling pairwise comparisons on ratio scales," European Journal of Operational Research, Elsevier, vol. 83(3), pages 639-654, June.
- Brozos-Vázquez, Miguel & Campo-Cabana, Marco Antonio & Díaz-Ramos, José Carlos & González-Díaz, Julio, 2008. "Ranking participants in tournaments by means of rating functions," Journal of Mathematical Economics, Elsevier, vol. 44(11), pages 1246-1256, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.