A Committee Ranking Problem Using Ordinal Utilities.
Abstract
This paper investigates aspects of obtaining a concensus ranking from ordinal rankings supplied by committee members. A procedure for calculating the distance between rankings which are represented by vectors is given along with an algorithm for deriving a min-max concensus ranking. In addition, an approach to the committee ranking problem which makes allowance for weights, partial rankings and multiple attributes is discussed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1977
- Accession Number
- ADA044408
Entities
People
- Ronald D. Armstrong
- Wade D. Cook
Organizations
- University of Texas at Austin