Almost optimal manipulation of a pair of alternatives
arXiv:2304.03060 · doi:10.1007/s10898-024-01391-3
Abstract
The role of an expert in the decision-making process is crucial, as the final recommendation depends on his disposition, clarity of mind, experience, and knowledge of the problem. However, the recommendation also depends on their honesty. But what if the expert is dishonest? Then, the answer on how difficult it is to manipulate in a given case becomes essential. In the presented work, we consider manipulation of a ranking obtained by comparing alternatives in pairs. More specifically, we propose an algorithm for finding an almost optimal way to swap the positions of two selected alternatives. Thanks to this, it is possible to determine how difficult such manipulation is in a given case. Theoretical considerations are illustrated by a practical example.
arXiv comment18 pages
References in corpus (11)
- The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
- An LP-based inconsistency monitoring of pairwise comparison matrices
- An Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections
- Towards quantification of incompleteness in the pairwise comparisons method
- Inconsistency indices for incomplete pairwise comparisons matrices
- On the geometric mean method for incomplete pairwise comparisons
- On the monotonicity of the eigenvector method
- Characterization of the row geometric mean ranking with a group consensus axiom
- Heuristic rating estimation - geometric approach
- Towards secure judgments aggregation in AHP
- On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levels