Priority Ranking and Consensus Formation: The Case of Ties
Ronald D. Armstrong,
Wade D. Cook and
Additional contact information
Ronald D. Armstrong: University of Georgia
Wade D. Cook: University of Texas, Austin
Management Science, 1982, vol. 28, issue 6, 638-645
This paper investigates the problem of obtaining a compromise/consensus from a set of ordinal rankings of n objects supplied by m committee members. Earlier work by Cook and Seiford (Cook, Wade D., Lawrence M. Seiford. 1978. Priority ranking and consensus formation. Management Sci. 24 (16) 1721--1732.) dealt with the problem of consensus when attention was restricted to complete rankings only. That is, no ties were permitted. This paper examines the general problem which allows for tied preferences. A convex polyhedral representation is given of the feasible solution space, and a branch-and-bound procedure is developed for determining an optimal ranking. Computational results for various problem sizes are presented. Generalizations, and directions for further research are discussed.
Keywords: utility/preference: theory; utility/preference: scaling; integer programming; applications (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (12) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:28:y:1982:i:6:p:638-645
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Matthew Walls ().