Preference rankings virtually appear in all field of science (behavioural sciences, machine learning, decision making and so on). The well-known social choice problem consists in trying to find a reasonable procedure to use the aggregate preferences expressed by subjects (usually called judges) to reach a collective decision. This problem turns out to be equivalent to the problem of estimating the consensus (central) ranking from data that is NP-hard. A branch and bound algorithm has been previously proposed to calculate the consensus ranking given n rankings expressed on m objects. We propose a new algorithm to find the consensus ranking that is perfectly equivalent to the previous algorithm in terms of solutions reached but permits a remarkable saving in computational time.
A heuristic algorithm for the consensus ranking problem / Amodio, Sonia; D'Ambrosio, Antonio; Siciliano, Roberta. - (2014). (Intervento presentato al convegno 7th International Conference of the ERCIM WG on Computational and Methodological Statistics (ERCIM 2014) tenutosi a Università di Pisa nel 6-8 Dicembre 2014).
A heuristic algorithm for the consensus ranking problem
AMODIO, SONIA;D'AMBROSIO, ANTONIO;SICILIANO, ROBERTA
2014
Abstract
Preference rankings virtually appear in all field of science (behavioural sciences, machine learning, decision making and so on). The well-known social choice problem consists in trying to find a reasonable procedure to use the aggregate preferences expressed by subjects (usually called judges) to reach a collective decision. This problem turns out to be equivalent to the problem of estimating the consensus (central) ranking from data that is NP-hard. A branch and bound algorithm has been previously proposed to calculate the consensus ranking given n rankings expressed on m objects. We propose a new algorithm to find the consensus ranking that is perfectly equivalent to the previous algorithm in terms of solutions reached but permits a remarkable saving in computational time.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
