Title: Ranking as parameter estimation

Authors: Miroslav Karny, Tatiana Valentine Guy

Addresses: Department of Adaptive Systems, Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic P.O. Box 18, 182 08 Prague 8, Czech Republic. ' Department of Adaptive Systems, Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic P.O. Box 18, 182 08 Prague 8, Czech Republic

Abstract: Ranking of alternatives is a common, difficult and repeatedly addressed problem, especially when it requires negotiation of experts. The celebrated Arrow|s impossibility theorem expresses formally its difficulty. In spite of the progress made by adopting soft ranking, the problem is far from being generically solved. The paper provides a, probably novel, problem formulation by viewing ranking of alternatives as an estimation of an unknown objective ranking vector. The idea is exposed on a specific task of ranking quality of projects by a large group of experts. The task is important on its own but the proposed methodology is the main message worth of generalisation and use in other application domains.

Keywords: alternatives ranking; Bayesian estimation; modelling; negotiation; parameter estimation; unknown objective ranking.

DOI: 10.1504/IJOR.2009.022597

International Journal of Operational Research, 2009 Vol.4 No.2, pp.142 - 158

Published online: 18 Jan 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article