Utopia in the solution of the Bucket Order Problem

作者：

Highlights：

• The standard greedy algorithm for OBOP, Bucket Pivot Algorithm (BPA), is significantly improved.

• The concept of utopian matrix is introduced and used to carry out an informed selection of the pivot.

• Several items are allowed to “give their opinion” during the ordering process, which yields a multi-pivot instead of single-pivot approach.

• Decision rules are provided to select the right BPA-based algorithm according to the decision maker preferences.

摘要

This paper deals with group decision making and, in particular, with rank aggregation, which is the problem of aggregating individual preferences (rankings) in order to obtain a consensus ranking. Although this consensus ranking is usually a permutation of all the ranked items, in this paper we tackle the situation in which some items can be tied, that is, the consensus shows that there is no preference among them. This problem has arisen recently and is known as the Optimal Bucket Order Problem (OBOP).

论文关键词：Bucket order,Utopian matrix,Bucket Pivot Algorithm,ranking,Multi-pivot

论文评审过程：Received 25 September 2016, Revised 9 March 2017, Accepted 13 March 2017, Available online 21 March 2017, Version of Record 22 April 2017.

论文官网地址：https://doi.org/10.1016/j.dss.2017.03.006