RANK N: A HIERARCHICAL PRIORITIZATION ALGORITHM

PDF

Authors
  1. Mason, D.W.
Corporate Authors
Operational Research and Analysis, Ottawa ONT (CAN) Directorate of Land Operational Research
Abstract
The RANK N algorithm addresses multi-level prioritization problems in which the rankers of a set of objects are themselves ranked objects, and is derived from a set of six basic assumptions or axioms. These axioms attempt to achieve a middle ground between the two extremes of group decision making; pure democracy and complete dictatorship. The RANK N algorithm that emerges has the form of a weighted summation where each "voter" carries a weight that is enhanced by 1 for each other voter outranked. Similarly, under each voter a given object carries a numerical "Quantum of Favourability" (QoF) that has a value equal to the number of other objects that the voter has ranked lower than the given object. The weighted sum of the QoF values provides the basis for the final ranking of the objects. Natural applications of RANK N include those situations where groups of individuals who have an inherent rank structure (such as the military) wish to derive a group ranking of a set of objects. RANK N takes one ranked set and produces a second ranked set, so it is applicable in a hierarchical fashion where objects rank other objects which, in turn, rank other objects, and so on. The report provides examples of high-level problems where a hierarchy of influence is established and entities in the Hierarchy "vote" on the priorities for entities at the next lowest level.
Keywords
Decision support
Report Number
ORA-DLOR-RN-9601 — Research Note
Date of publication
01 Jan 1996
Number of Pages
62
DSTKIM No
96-01512
CANDIS No
155556
Format(s):
Document Image stored on Optical Disk;Hardcopy

Permanent link

Document 1 of 1

Date modified: