z-logo
open-access-imgOpen Access
Rankings analysis with the Pareto method
Author(s) -
Carlos Andres Delgado-Saavedra,
Ángel García Baños,
Víctor Bucheli
Publication year - 2020
Publication title -
aibi revista de investigación administración e ingeniería
Language(s) - English
Resource type - Journals
ISSN - 2346-030X
DOI - 10.15649/2346030x.852
Subject(s) - ranking (information retrieval) , rank (graph theory) , pareto principle , computer science , order (exchange) , operations research , resource (disambiguation) , econometrics , statistics , information retrieval , mathematics , economics , computer network , finance , combinatorics
Rankings compare the performance of organizations. In many cases, rankings provide a good assessment of successful or-ganizations. However, rankings often generate controversy and debate since they support the making decisions. A ranking is a weighted linear combination of indicators, and the weights assigned to each of the indicators can lead to different rank orders. In most cases, rankings are used as a tool to support making decisions, such as resource allocation; therefore, these decisions can be affected by the assignment of such weights. In this article, we analyze the behavior of a ranking and the weights; simulations are used to calculate the change in the order of the equally weighted ranking and of the randomly weighted ranking. In this regard, we present a discussion and ranking design alternatives.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom