Soft Computing

Recently, a new type of set, called random permutation set (RPS), is proposed by considering all the permutations of elements in a certain set. For measuring the uncertainty of RPS, the entropy of RPS is presented. However, the maximum entropy principle of RPS entropy has not been discussed. To address this issue, this paper presents the maximum entropy of RPS. The analytical solution of maximum RPS entropy and its PMF condition are proven and discussed. Besides, numerical examples are used to illustrate the maximum RPS entropy. The results show that the maximum RPS entropy is compatible with the maximum Deng entropy and the maximum Shannon entropy. Moreover, in order to further apply RPS entropy and maximum RPS entropy in practical fields, a comparative analysis of the choice of using Shannon entropy, Deng entropy, and RPS entropy is also carried out.

Maximum entropy of random permutation set