Choice mechanisms of quasi-tournament type. II

A family of choice procedures using pair-comparison matrices is examined. The presented procedures are generalizations of known choice procedures that use “point sum” rules, Copeland rules, and graph medians, and which occur naturally in the examination of a broad range of problems related to specimen recognition graph theory, and multicriterion optimization. Systems of linear equations and inequalities are used to study the properties of these choice procedures.