Sebastian Ernst
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sebastian Ernst has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Jacek Szybowski
The Faculty of Applied Mathematics AGH University of Science and Technology al. Mickiewicza 30 30-059 Krakow Poland
3 shared publications - Konrad Kułakowski
Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, AGH University of Krakow, Al. Mickiewicza 30, 30-059 Krakow, Poland
3 shared publications - Jiří Mazurek
Department of Informatics and Mathematics School of Business Administration in Karvina Silesian University in Opava Univerzitni namesti 1934 /3 Czech Republic
1 shared publication
Latest Publications
- Open Access
- 12 April 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (1) , 243-259
Almost optimal manipulation of pairwise comparisons of alternatives
The role of an expert in the decision-making process is crucial. If we ask an expert to help us to make a decision we assume their honesty. But what if the expert is dishonest? Then, the answer on how difficult it is for an expert to provide manipulated data in a given case of decision-making process becomes essential. In the presented work, we consider manipulation of a ranking obtained by the Geometric Mean Method applied to a pairwise comparisons matrix. More specifically, we propose an algorithm for finding an almost optimal way to swap the positions of two selected alternatives in a ranking. We also define a new index which measures how difficult such manipulation is in a given case.
- 12 April 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (1) , 243-259
Open AccessAlmost optimal manipulation of pairwise comparisons of alternatives
The role of an expert in the decision-making process is crucial. If we ask an expert to help us to make a decision we assume their honesty. But what if the expert is dishonest? Then, the answer on how difficult it is for an expert to provide manipulated data in a given case of decision-making process becomes essential. In the presented work, we consider manipulation of a ranking obtained by the Geometric Mean Method applied to a pairwise comparisons matrix. More specifically, we propose an algorithm for finding an almost optimal way to swap the positions of two selected alternatives in a ranking. We also define a new index which measures how difficult such manipulation is in a given case.
- Open Access
Almost optimal manipulation of a pair of alternatives
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.
Open AccessAlmost optimal manipulation of a pair of alternatives
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.
- Open Access
Towards secure judgments aggregation in AHP
In decision-making methods, it is common to assume that the experts are honest and professional. However, this is not the case when one or more experts in the group decision making framework, such as the group analytic hierarchy process (GAHP), try to manipulate results in their favor. The aim of this paper is to introduce two heuristics in the GAHP, setting allowing to detect the manipulators and minimize their effect on the group consensus by diminishing their weights. The first heuristic is based on the assumption that manipulators will provide judgments which can be considered outliers with respect to those of the rest of the experts in the group. The second heuristic assumes that dishonest judgments are less consistent than the average consistency of the group. Both approaches are illustrated with numerical examples and simulations.
Open AccessTowards secure judgments aggregation in AHP
In decision-making methods, it is common to assume that the experts are honest and professional. However, this is not the case when one or more experts in the group decision making framework, such as the group analytic hierarchy process (GAHP), try to manipulate results in their favor. The aim of this paper is to introduce two heuristics in the GAHP, setting allowing to detect the manipulators and minimize their effect on the group consensus by diminishing their weights. The first heuristic is based on the assumption that manipulators will provide judgments which can be considered outliers with respect to those of the rest of the experts in the group. The second heuristic assumes that dishonest judgments are less consistent than the average consistency of the group. Both approaches are illustrated with numerical examples and simulations.