The minimum acceptable violation ranking of alternatives from voters' ordinal rankings

Kelin Luo, Yinfeng Xu

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

Motived by applications of ordinal ranking and adjustment consensus in group decision making, we study the problem of aggregating all voters’ ordinal ranking on a set of alternatives into an adjusted “consensus” ranking. In this problem, every voter ranks a set of alternatives respectively, and we know the adjustment acceptability. The problem is to find an optimal ordinal ranking which minimizes the sum of voter’s acceptable violation. We analyse this problem by utilizing both pairwise preference and order-based ranking, and develop a branch-and-bound algorithm to solve this problem. The effectiveness and efficiency of this algorithm are verified with a small example and numerical experiments.
Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications, (COCOA 2015)
EditorsZ. Lu, D. Kim, W. Wu, W. Li
Place of PublicationCham
PublisherSpringer
Pages758-770
Number of pages13
ISBN (Electronic)978-3-319-26626-8
ISBN (Print)978-3-319-26625-1
DOIs
Publication statusPublished - 2015
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
Volume9486

Keywords

  • Group decisions
  • Ordinal ranking
  • Acceptability index
  • Branch-and-bound algorithm

Cite this