Can simple voting rules approximate the group AHP?

Abstract

We analyze by means of simulations whether simple voting rules can approximate a group priority obtained by a standard aggregation method used in the group Analytic Hierarchy Process (AHP). Results show that under certain conditions, some voting rules provide relatively good approximations. It suggests a way of estimating the aggregated group priority easily in some situations. This short paper provides, by the nature of simulations, example results to consider the approximation issue, rather than general results.