Abstract
An algorithm for processing the results of paired comparisons in order to estimate the quality of alternatives is proposed. It is shown that through the use of the new algorithm it is possible to abandon the traditional method, which employs one of the eigenvectors of the matrix of paired comparisons for these purposes. By means of the new algorithm, additional constraints in ranking alternatives by the method of paired comparisons may be eliminated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
