@inbook{bb567db2630644eaa01adeeab2aff4d3,

title = "The minimum acceptable violation ranking of alternatives from voters' ordinal rankings",

abstract = "Motived by applications of ordinal ranking and adjustment consensus in group decision making, we study the problem of aggregating all voters{\textquoteright} 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{\textquoteright}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.",

keywords = "Group decisions, Ordinal ranking, Acceptability index, Branch-and-bound algorithm",

author = "Kelin Luo and Yinfeng Xu",

year = "2015",

doi = "10.1007/978-3-319-26626-8_56",

language = "English",

isbn = "978-3-319-26625-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "758--770",

editor = "Z. Lu and D. Kim and W. Wu and W. Li",

booktitle = "Combinatorial Optimization and Applications, (COCOA 2015)",

address = "Germany",

}