Ranking as parameter estimation (Q1019554)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ranking as parameter estimation |
scientific article; zbMATH DE number 5561292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ranking as parameter estimation |
scientific article; zbMATH DE number 5561292 |
Statements
Ranking as parameter estimation (English)
0 references
3 June 2009
0 references
Summary: 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.
0 references
alternatives ranking
0 references
Bayesian estimation
0 references
modelling
0 references
negotiation
0 references
parameter estimation
0 references
unknown objective ranking
0 references
0.8798964
0 references
0 references