Ranking from Pairwise Comparisons in the Belief Functions Framework
The problem of deriving a binary relation over alternatives based on paired comparisons is studied. The problem is tackled in the framework of belief functions, which is well-suited to model and manipulate partial and uncertain information. Starting from the work of Tritchler and Lockwood , the paper proposes a general model of mass allocation and combination, and shows how to practically derive a complete or a partial ranking of the alternatives. A small example is provided as an illustration.
KeywordsPartial Order Linear Order Paired Comparison Mass Function Linear Extension
Unable to display preview. Download preview PDF.
- 7.Smets, P.: The Transferable Belief Model for quantified belief representation. In: Gabbay, D.M., Smets, P. (eds.) Hanbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 267–301. Kluwer Academic Publishers, Dordrecht (1998)Google Scholar