JSJacek Szybowski

Jacek Szybowski

*This is an algorithmically generated author record based on publicly available information.

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


Jacek Szybowski has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Assessment-Driven Judgment Aggregation Within a Group of Peers

    by Konrad Kułakowski, Jacek Szybowski

    Group decision-making sometimes involves evaluating the decision-makers themselves, e.g., selecting the best expert or assigning rewards within a team. In such cases, all participants should be involved, but their influence should reflect their competence or contribution. This article proposes two new opinion aggregation models in which a person’s assessment weight depends on their ranking, preventing low-performing members from exerting the same influence and promoting respected experts. The proposed aggregation methods uphold the principle of distributive justice by ensuring that individual contributions are proportional to the rewards they receive. In addition to formulating new methods for aggregating results, we presented several of their formal properties and indicated practical ways to calculate the results. For one of the methods, which is more challenging to compute, we conducted a Monte Carlo experiment demonstrating the practical feasibility of computing the aggregated weight vector.

  • Open Access

    Detection of Decision-Making Manipulation in the Pairwise Comparison Method

    by Michał Strada, Sebastian Ernst, Jacek Szybowski, Konrad Kułakowski

    Most decision-making models, including the pairwise comparison method, assume the honesty of the decision-maker. However, it is easy to imagine a situation where the decision-maker tries to manipulate the ranking results. This problem applies to many decision-making methods, including the pairwise comparison method. This article proposes three simple algorithmic methods for manipulating data using the pairwise comparison method. The proposed solutions try to mimic the behavior of a dishonest decision-maker who, acting under time pressure, chooses a simple strategy that leads to pushing through a given alternative. We also test the susceptibility to detection of the proposed manipulation strategies. To this end, we propose a convolutional neural network architecture, which we train based on generated data consisting of the original random pairwise comparison matrices and their manipulated counterparts. Our approach treats the pairwise comparison matrices as two- or three-dimensional images specific to the decision situation. In the latter case, the matrices are initially transformed into a three-dimensional map of local inconsistencies, and only data processed in this way are subjected to analysis using neural networks. The experiments indicate a significant level of detection of the proposed manipulations. In numerical tests, the effectiveness of the presented solution ranges from 88% to 100% effectiveness, depending on the tested algorithm and test parameters. The measured average computation time for the single case analyzed oscillated below one millisecond, which is a more than satisfactory result of the performance of the built implementation. We can successfully use the neural networks trained on synthetic data to detect manipulation attempts carried out by real experts. Preliminary tests with respondents also indicated high effectiveness in detecting manipulation. At the same time, they signaled the difficulty of distinguishing actual manipulation from a situation in which an expert strongly prefers one or more selected alternatives.

  • On homology groups for pairwise comparisons method

    by Waldemar W. Koczkodaj, Witold Pedrycz, Alexander Pigazzini, Yingli Song, Jacek Szybowski

  • Open Access

    Almost optimal manipulation of pairwise comparisons of alternatives

    by Jacek Szybowski, Konrad Kułakowski, Sebastian Ernst

    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

    Establishing a leader in a pairwise comparisons method

    by Jacek Szybowski, Konrad Kułakowski, Jiri Mazurek, Sebastian Ernst

    Abstract Like electoral systems, decision-making methods are also vulnerable to manipulation by decision-makers. The ability to effectively defend against such threats can only come from thoroughly understanding the manipulation mechanisms. In the presented article, we show two algorithms that can be used to launch a manipulation attack. They allow for equating the weights of two selected alternatives in the pairwise comparison method and, consequently, choosing a leader. The theoretical considerations are accompanied by a Monte Carlo simulation showing the relationship between the size of the PC matrix, the degree of inconsistency, and the ease of manipulation. This work is a continuation of our previous research published in the paper (Szybowski et al., 2023)

  • Open Access

    Resilient heuristic aggregation of judgments in the pairwise comparisons method

    by Konrad Kułakowski, Jacek Szybowski, Jiri Mazurek, Sebastian Ernst


  • Open Access

    Almost optimal manipulation of a pair of alternatives

    by Jacek Szybowski, Konrad Kułakowski, Sebastian Ernst

    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

    by Konrad Kułakowski, Jacek Szybowski, Jiri Mazurek, Sebastian Ernst

    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 Access

    New inconsistency indicators for incomplete pairwise comparisons matrices

    by Jacek Szybowski, Konrad Kułakowski, Anna Prusak


  • On the use of group theory to generalize elements of pairwise comparisons matrix: A cautionary note

    by W.W. Koczkodaj, F. Liu, V.W. Marek, J. Mazurek, M. Mazurek, L. Mikhailov, C. Özel, W. Pedrycz, A. Przelaskowski, A. Schumann, et al.