A ranking procedure based on a natural monotonicity constraint |
| |
| Affiliation: | 1. Department of Mathematics, Malda College, Malda, West Bengal 712101, India;2. Department of Mathematics, Presidency University, 86/1 College Street, Kolkata 700073, India;1. Department of Computer Science, City University of Hong Kong, Hong Kong, PR China;2. College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, PR China;3. School of Mathematics and Statistics, Xidian University, Xi''an, PR China;1. Department of Computer Science, Rutgers University, Piscataway, NJ 08854, USA;2. Department of Health Statistics, Weifang Medical University, Weifang, Shandong 261053, China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
