A ranking procedure based on a natural monotonicity constraint

We formulate a new ranking procedure in the traditional context where each voter has expressed a linear order relation or ranking over the candidates. The final ranking of the candidates is taken to be the one which best adheres to a natural monotonicity constraint. For a ranking a≻b≻c, monotonicity...

Full description

Saved in:
Bibliographic Details
Published in:Information fusion 2014-05, Vol.17, p.74-82
Main Authors: Rademaker, Michael, De Baets, Bernard
Format: Article
Language:English
Subjects:
Monotonicity
Ranking
Social ordering
Social preference
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We formulate a new ranking procedure in the traditional context where each voter has expressed a linear order relation or ranking over the candidates. The final ranking of the candidates is taken to be the one which best adheres to a natural monotonicity constraint. For a ranking a≻b≻c, monotonicity implies that the strength with which a≻c is supported should not be less than the strength with which either one of a≻b or b≻c is supported. We investigate some properties of this ranking procedure and encounter some surprising preliminary results.
ISSN:1566-2535
1872-6305
DOI:10.1016/j.inffus.2012.01.003