2025
Strada, M.; Kułakowski, K.
Manipulation of individual judgments in the quantitative pairwise comparisons method Journal Article Forthcoming
In: International Journal of Information Technology & Decision Making, Forthcoming.
@article{Strada20205moij,
title = {Manipulation of individual judgments in the quantitative pairwise comparisons method},
author = {Strada, M. and Kułakowski, K.},
year = {2025},
date = {2025-01-30},
urldate = {2025-01-30},
journal = {International Journal of Information Technology & Decision Making},
keywords = {},
pubstate = {forthcoming},
tppubtype = {article}
}
2024
Szybowski, J.; Kułakowski, K.; Ernst, S.
Almost optimal manipulation of pairwise comparisons of alternatives Journal Article
In: Journal of Global Optimization, vol. 90, no. 1, pp. 243–259, 2024, ISSN: 1573-2916.
@article{Szybowski2024aomo,
title = {Almost optimal manipulation of pairwise comparisons of alternatives},
author = {J. Szybowski and K. Kułakowski and S. Ernst},
url = {http://dx.doi.org/10.1007/s10898-024-01391-3},
doi = {10.1007/s10898-024-01391-3},
issn = {1573-2916},
year = {2024},
date = {2024-04-01},
urldate = {2024-04-01},
journal = {Journal of Global Optimization},
volume = {90},
number = {1},
pages = {243–259},
publisher = {Springer Science and Business Media LLC},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Strada, M.; Ernst, S.; Szybowski, J.; Kułakowski, K.
Detection of Decision-Making Manipulation in the Pairwise Comparison Method Journal Article
In: Applied Sciences, vol. 14, no. 19, 2024, ISSN: 2076-3417.
@article{Strada2024dodm,
title = {Detection of Decision-Making Manipulation in the Pairwise Comparison Method},
author = {M. Strada and S. Ernst and J. Szybowski and K. Kułakowski},
url = {https://www.mdpi.com/2076-3417/14/19/8946},
doi = {10.3390/app14198946},
issn = {2076-3417},
year = {2024},
date = {2024-01-01},
urldate = {2024-01-01},
journal = {Applied Sciences},
volume = {14},
number = {19},
abstract = {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.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
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.
Szybowski, J.; Kułakowski, K.; Mazurek, J.; Ernst, S.
Establishing a leader in a pairwise comparisons method Miscellaneous
2024.
@misc{szybowski2024establishing,
title = {Establishing a leader in a pairwise comparisons method},
author = {J. Szybowski and K. Kułakowski and J. Mazurek and S. Ernst},
year = {2024},
date = {2024-01-01},
urldate = {2024-01-01},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Kułakowski, K.; Szybowski, J.; Mazurek, J.; Ernst, S.
Resilient heuristic aggregation of judgments in the pairwise comparisons method Journal Article
In: Information Sciences, vol. 657, pp. 119979, 2024, ISSN: 0020-0255.
@article{Kulakowski2024rhao,
title = {Resilient heuristic aggregation of judgments in the pairwise comparisons method},
author = {K. Kułakowski and J. Szybowski and J. Mazurek and S. Ernst},
url = {https://www.sciencedirect.com/science/article/pii/S0020025523015645},
doi = {https://doi.org/10.1016/j.ins.2023.119979},
issn = {0020-0255},
year = {2024},
date = {2024-01-01},
urldate = {2024-01-01},
journal = {Information Sciences},
volume = {657},
pages = {119979},
abstract = {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 pairwise-based group decision-making framework, such as the group analytic hierarchy process, try to manipulate results in their favor. This paper aims to introduce two heuristics enabling detection of manipulators and minimizing their effect on the group consensus by diminishing their weights. The first heuristic is based on the assumption that manipulators will provide judgments that can be considered outliers with respect to those of the other 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.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
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 pairwise-based group decision-making framework, such as the group analytic hierarchy process, try to manipulate results in their favor. This paper aims to introduce two heuristics enabling detection of manipulators and minimizing their effect on the group consensus by diminishing their weights. The first heuristic is based on the assumption that manipulators will provide judgments that can be considered outliers with respect to those of the other 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.
Kułakowski, K.; Szybowski, J.
My part is bigger than yours – assessment within a group of peers Miscellaneous
2024.
@misc{Kulakowski2024mpib,
title = {My part is bigger than yours – assessment within a group of peers},
author = {K. Kułakowski and J. Szybowski},
url = {https://arxiv.org/abs/2407.01843},
year = {2024},
date = {2024-01-01},
urldate = {2024-01-01},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
2023
Kędzior, A.; Kułakowski, K.
Multiple-Criteria Heuristic Rating Estimation Journal Article
In: Mathematics, vol. 11, no. 13, 2023, ISSN: 2227-7390.
@article{Kedzior2023mchr,
title = {Multiple-Criteria Heuristic Rating Estimation},
author = {A. Kędzior and K. Kułakowski},
url = {https://www.mdpi.com/2227-7390/11/13/2806},
doi = {10.3390/math11132806},
issn = {2227-7390},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
journal = {Mathematics},
volume = {11},
number = {13},
abstract = {One of the most widespread multi-criteria decision-making methods is the Analytic Hierarchy Process (AHP). AHP successfully combines the pairwise comparisons method and the hierarchical approach. It allows the decision-maker to set priorities for all ranked alternatives. But what if, for some of them, their ranking value is known (e.g., it can be determined differently)? The Heuristic Rating Estimation (HRE) method proposed in 2014 tried to bring the answer to this question. However, the considerations were limited to a model only considering a few criteria. This work analyzes how HRE can be used as part of the AHP hierarchical framework. The theoretical considerations are accompanied by illustrative examples showing HRE as a multiple-criteria decision-making method.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
One of the most widespread multi-criteria decision-making methods is the Analytic Hierarchy Process (AHP). AHP successfully combines the pairwise comparisons method and the hierarchical approach. It allows the decision-maker to set priorities for all ranked alternatives. But what if, for some of them, their ranking value is known (e.g., it can be determined differently)? The Heuristic Rating Estimation (HRE) method proposed in 2014 tried to bring the answer to this question. However, the considerations were limited to a model only considering a few criteria. This work analyzes how HRE can be used as part of the AHP hierarchical framework. The theoretical considerations are accompanied by illustrative examples showing HRE as a multiple-criteria decision-making method.
Kułakowski, K.; Szybowski, J.; Mazurek, J.; Ernst, S.
Towards secure judgments aggregation in AHP Miscellaneous
2023.
@misc{kulakowski2023tsjaArxiv,
title = {Towards secure judgments aggregation in AHP},
author = {K. Kułakowski and J. Szybowski and J. Mazurek and S. Ernst},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
Szybowski, J.; Kułakowski, K.; Ernst, S.
Almost optimal manipulation of a pair of alternatives Journal Article
In: accepted for publication in Journal of Global Optimization, 2023.
@article{Szybowski2023aomoArxiv,
title = {Almost optimal manipulation of a pair of alternatives},
author = {J. Szybowski and K. Kułakowski and S. Ernst},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
journal = {accepted for publication in Journal of Global Optimization},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2022
Kułakowski, K.; Kędzior, A.
Heuristic Rating Estimation Method for the incomplete pairwise comparisons matrices Journal Article
In: 2022.
@article{Kulakowski2022hrem,
title = {Heuristic Rating Estimation Method for the incomplete pairwise comparisons matrices},
author = {K. Kułakowski and A. Kędzior},
url = {https://arxiv.org/abs/2207.10783},
doi = {10.48550/ARXIV.2207.10783},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
publisher = {arXiv},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Mazurek, J.; Kułakowski, K.
On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels Journal Article
In: International Journal of Approximate Reasoning, vol. 150, pp. 242-257, 2022, ISSN: 0888-613X.
@article{Mazurek2022otdo,
title = {On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels},
author = {J. Mazurek and K. Kułakowski},
url = {https://www.sciencedirect.com/science/article/pii/S0888613X22001268},
doi = {https://doi.org/10.1016/j.ijar.2022.08.014},
issn = {0888-613X},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
journal = {International Journal of Approximate Reasoning},
volume = {150},
pages = {242-257},
abstract = {In this paper, we propose a new method for the derivation of a priority vector from an incomplete pairwise comparisons (PC) matrix. We assume that each entry of a PC matrix provided by an expert is also evaluated in terms of the expert's confidence in a particular judgment. Then, from corresponding graph representations of a given PC matrix, all spanning trees are found. For each spanning tree, a unique priority vector is obtained with the weight corresponding to the confidence levels of entries that constitute this tree. At the end, the final priority vector is obtained through an aggregation of priority vectors achieved from all spanning trees. Confidence levels are modeled by real (crisp) numbers and triangular fuzzy numbers. Numerical examples and comparisons with other methods are also provided. Last, but not least, we introduce a new formula for an upper bound of the number of spanning trees, so that a decision maker gains knowledge (in advance) on how computationally demanding the proposed method is for a given PC matrix.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we propose a new method for the derivation of a priority vector from an incomplete pairwise comparisons (PC) matrix. We assume that each entry of a PC matrix provided by an expert is also evaluated in terms of the expert's confidence in a particular judgment. Then, from corresponding graph representations of a given PC matrix, all spanning trees are found. For each spanning tree, a unique priority vector is obtained with the weight corresponding to the confidence levels of entries that constitute this tree. At the end, the final priority vector is obtained through an aggregation of priority vectors achieved from all spanning trees. Confidence levels are modeled by real (crisp) numbers and triangular fuzzy numbers. Numerical examples and comparisons with other methods are also provided. Last, but not least, we introduce a new formula for an upper bound of the number of spanning trees, so that a decision maker gains knowledge (in advance) on how computationally demanding the proposed method is for a given PC matrix.
Kędzior, A.; Kułakowski, K.
Multiple-criteria Heuristic Rating Estimation Journal Article
In: 2022.
@article{Kedzior2022mchr,
title = {Multiple-criteria Heuristic Rating Estimation},
author = {A. Kędzior and K. Kułakowski},
url = {https://arxiv.org/abs/2205.10428},
doi = {10.48550/ARXIV.2205.10428},
year = {2022},
date = {2022-01-01},
urldate = {2022-01-01},
publisher = {arXiv},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Mazurek, J.; Kułakowski, K.; Ernst, S.; Strada, M.
Some Notes on the Similarity of Priority Vectors Derived by the Eigenvalue Method and the Geometric Mean Method Journal Article
In: Procedia Computer Science, vol. 207, pp. 504-513, 2022, ISSN: 1877-0509, (Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES2022).
@article{Mazurek2022snot,
title = {Some Notes on the Similarity of Priority Vectors Derived by the Eigenvalue Method and the Geometric Mean Method},
author = {J. Mazurek and K. Kułakowski and S. Ernst and M. Strada},
url = {https://www.sciencedirect.com/science/article/pii/S1877050922009863},
doi = {https://doi.org/10.1016/j.procs.2022.09.105},
issn = {1877-0509},
year = {2022},
date = {2022-01-01},
journal = {Procedia Computer Science},
volume = {207},
pages = {504-513},
abstract = {This paper examines the differences in ordinal rankings obtained from a pairwise comparison matrix using the eigenvalue method and the geometric mean method. First, we introduce several propositions on the (dis)similarity of both rankings concerning the matrix size and its inconsistency expressed by the Koczkodaj's inconsistency index. Further on, we examine the relationship between differences in both rankings and Kendall's rank correlation coefficient τ and Spearman's rank coefficient ρ. Apart from theoretical results, intuitive numerical examples and Monte Carlo simulations are also provided.},
note = {Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES2022},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper examines the differences in ordinal rankings obtained from a pairwise comparison matrix using the eigenvalue method and the geometric mean method. First, we introduce several propositions on the (dis)similarity of both rankings concerning the matrix size and its inconsistency expressed by the Koczkodaj's inconsistency index. Further on, we examine the relationship between differences in both rankings and Kendall's rank correlation coefficient τ and Spearman's rank coefficient ρ. Apart from theoretical results, intuitive numerical examples and Monte Carlo simulations are also provided.
2021
Mazurek, J.; Kułakowski, K.
On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levels Journal Article
In: 2021.
@article{mazurek2021otdo,
title = {On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levels},
author = {J. Mazurek and K. Kułakowski},
url = {https://arxiv.org/abs/2112.10253},
year = {2021},
date = {2021-01-01},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Prusak, D.; Karpiel, G.; Kułakowski, K.
The Architecture of a Real-Time Control System for Heating Energy Management in the Intelligent Building Journal Article
In: Energies, vol. 14, no. 17, 2021, ISSN: 1996-1073.
@article{Prusak2021taoa,
title = {The Architecture of a Real-Time Control System for Heating Energy Management in the Intelligent Building},
author = {D. Prusak and G. Karpiel and K. Kułakowski},
url = {https://www.mdpi.com/1996-1073/14/17/5402},
doi = {10.3390/en14175402},
issn = {1996-1073},
year = {2021},
date = {2021-01-01},
journal = {Energies},
volume = {14},
number = {17},
abstract = {Very often, constructors and designers of intelligent building and building automation systems have a choice: to create a compact system with a limited configuration and modifying the system’s behavior possibilities or provide a fully configurable solution at the expense of introducing a full SCADA system equipped with an additional knowledge database and inference system equipped with learning capabilities. In the presented work, we show that there is a third solution. Using a multilayer control system composed of programmable FPGAs, small PCs, and cloud computing resources, we can design and implement a fully configurable intelligent control system for the building’s heating. Our solution combines the compactness of the structure and the ease of installation and assembly.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Very often, constructors and designers of intelligent building and building automation systems have a choice: to create a compact system with a limited configuration and modifying the system’s behavior possibilities or provide a fully configurable solution at the expense of introducing a full SCADA system equipped with an additional knowledge database and inference system equipped with learning capabilities. In the presented work, we show that there is a third solution. Using a multilayer control system composed of programmable FPGAs, small PCs, and cloud computing resources, we can design and implement a fully configurable intelligent control system for the building’s heating. Our solution combines the compactness of the structure and the ease of installation and assembly.
Urbaniec, M.; Sołtysik, M.; Prusak, A.; Kułakowski, K.; Wojnarowska, M.
Fostering sustainable entrepreneurship by business strategies: An explorative approach in the bioeconomy Journal Article
In: Business Strategy and the Environment, 2021.
@article{Urbaniec2021wseb,
title = {Fostering sustainable entrepreneurship by business strategies: An explorative approach in the bioeconomy},
author = {M. Urbaniec and M. Sołtysik and A. Prusak and K. Kułakowski and M. Wojnarowska},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/bse.2885},
doi = {https://doi.org/10.1002/bse.2885},
year = {2021},
date = {2021-01-01},
journal = {Business Strategy and the Environment},
abstract = {Abstract The conceptual framework of bioeconomy advances sustainability by ensuring that environmental, social, and economic goals are met. Although numerous authors perceive bioeconomy as a key sector to achieve sustainable transformation, there is a lack of a comprehensive set of factors determining sustainable entrepreneurship in the bioeconomy sector. This study aims to identify factors influencing business strategies for sustainable entrepreneurship in the bioeconomy sector. This study uses the triangulation of research methods, including the entrepreneurial discovery process, as well as multiple-criteria methods of the pairwise comparison and the analytic hierarchy process. This study serves as grounds for the identification of priority factors influencing the choice of relevant business strategies in the bioeconomy. Within the framework of the research, five core factors are specified: economic-and-financial, market, technological, ecological, organization-and-human resources, and legal. The findings reveal that the most significant factors are economic-and-financial and market factors that determine the choice of innovative and offensive strategies by bioeconomy enterprises. These strategies impact entrepreneurial decision-making processes in the environmental and social areas, and they contribute to the development of more sustainable and entrepreneurial ecosystems. To advance the research on sustainable entrepreneurship, different theoretical perspectives are combined, including economics, strategic management, and innovation perspective.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Abstract The conceptual framework of bioeconomy advances sustainability by ensuring that environmental, social, and economic goals are met. Although numerous authors perceive bioeconomy as a key sector to achieve sustainable transformation, there is a lack of a comprehensive set of factors determining sustainable entrepreneurship in the bioeconomy sector. This study aims to identify factors influencing business strategies for sustainable entrepreneurship in the bioeconomy sector. This study uses the triangulation of research methods, including the entrepreneurial discovery process, as well as multiple-criteria methods of the pairwise comparison and the analytic hierarchy process. This study serves as grounds for the identification of priority factors influencing the choice of relevant business strategies in the bioeconomy. Within the framework of the research, five core factors are specified: economic-and-financial, market, technological, ecological, organization-and-human resources, and legal. The findings reveal that the most significant factors are economic-and-financial and market factors that determine the choice of innovative and offensive strategies by bioeconomy enterprises. These strategies impact entrepreneurial decision-making processes in the environmental and social areas, and they contribute to the development of more sustainable and entrepreneurial ecosystems. To advance the research on sustainable entrepreneurship, different theoretical perspectives are combined, including economics, strategic management, and innovation perspective.
Kułakowski, K.; Mazurek, J.; Strada, M.
On the similarity between ranking vectors in the pairwise comparison method Journal Article
In: Journal of the Operational Research Society, vol. 0, no. 0, pp. 1-10, 2021.
@article{kulakowski2021otsb,
title = {On the similarity between ranking vectors in the pairwise comparison method},
author = {K. Kułakowski and J. Mazurek and M. Strada},
url = {https://doi.org/10.1080/01605682.2021.1947754},
doi = {10.1080/01605682.2021.1947754},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
journal = {Journal of the Operational Research Society},
volume = {0},
number = {0},
pages = {1-10},
publisher = {Taylor & Francis},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2020
Kułakowski, K.
On the Geometric Mean Method for Incomplete Pairwise Comparisons Journal Article
In: Mathematics, vol. 8, no. 1873, pp. 1-12, 2020.
@article{kulakowski2020otgm,
title = {On the Geometric Mean Method for Incomplete Pairwise Comparisons},
author = {K. Kułakowski},
url = {https://www.mdpi.com/2227-7390/8/11/1873},
doi = {https://doi.org/10.3390/math8111873},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {Mathematics},
volume = {8},
number = {1873},
pages = {1-12},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.; Talaga, D.
Inconsistency indices for incomplete pairwise comparisons matrices Journal Article
In: International Journal of General Systems, vol. 49, no. 2, pp. 174-200, 2020.
@article{Kulakowski2020iifi,
title = {Inconsistency indices for incomplete pairwise comparisons matrices},
author = {K. Kułakowski and D. Talaga},
url = {https://doi.org/10.1080/03081079.2020.1713116},
doi = {10.1080/03081079.2020.1713116},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {International Journal of General Systems},
volume = {49},
number = {2},
pages = {174-200},
publisher = {Taylor & Francis},
abstract = {Comparing alternatives in pairs is a very well known technique of ranking creation. The answer to how reliable and trustworthy ranking depends on the inconsistency of the data from which it was created. There are many indices used for determining the level of inconsistency among compared alternatives. Unfortunately, most of them assume that the set of comparisons is complete, i.e. every single alternative is compared to each other. This is not true and the ranking must sometimes be made based on incomplete data. In order to fill this gap, this work aims to adapt several existing inconsistency indices for the purpose of analyzing incomplete data sets. The modified indices are subjected to Monte Carlo experiments. Those of them that achieved the best results in the experiments carried out are recommended for use in practice.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Comparing alternatives in pairs is a very well known technique of ranking creation. The answer to how reliable and trustworthy ranking depends on the inconsistency of the data from which it was created. There are many indices used for determining the level of inconsistency among compared alternatives. Unfortunately, most of them assume that the set of comparisons is complete, i.e. every single alternative is compared to each other. This is not true and the ranking must sometimes be made based on incomplete data. In order to fill this gap, this work aims to adapt several existing inconsistency indices for the purpose of analyzing incomplete data sets. The modified indices are subjected to Monte Carlo experiments. Those of them that achieved the best results in the experiments carried out are recommended for use in practice.
Szybowski, J.; Kułakowski, K.; Prusak, A.
New inconsistency indicators for incomplete pairwise comparisons matrices Journal Article
In: Mathematical Social Sciences, vol. 108, pp. 138 - 145, 2020, ISSN: 0165-4896.
@article{szybowski2000niif,
title = {New inconsistency indicators for incomplete pairwise comparisons matrices},
author = {J. Szybowski and K. Kułakowski and A. Prusak},
url = {http://www.sciencedirect.com/science/article/pii/S016548962030055X},
doi = {https://doi.org/10.1016/j.mathsocsci.2020.05.002},
issn = {0165-4896},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {Mathematical Social Sciences},
volume = {108},
pages = {138 - 145},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
Understanding The Analytic Hierarchy Process Book
Chapman & Hall, Taylor and Francis Group, 2020, ISBN: 978-1-138-03232-3.
@book{kulakowski2020uahp,
title = {Understanding The Analytic Hierarchy Process},
author = {K. Kułakowski},
url = {https://www.taylorfrancis.com/books/9781315392226},
doi = {https://doi.org/10.1201/b21817},
isbn = {978-1-138-03232-3},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
publisher = {Chapman & Hall, Taylor and Francis Group},
series = {CRC Series in Operations Research},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Kułakowski, K.; Mazurek, J.; Strada, M.
On the similarity between ranking vectors in the pairwise comparison method Journal Article
In: CoRR, vol. abs/2010.04778, 2020.
@article{Kulakowski2020otsb,
title = {On the similarity between ranking vectors in the pairwise comparison method},
author = {K. Kułakowski and J. Mazurek and M. Strada},
url = {https://arxiv.org/abs/2010.04778},
year = {2020},
date = {2020-01-01},
urldate = {2020-01-01},
journal = {CoRR},
volume = {abs/2010.04778},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Mazurek, J.; Kułakowski, K.
Satisfaction of the condition of order preservation: A simulation study. Journal Article
In: Operations Research and Decisions, vol. 30, no. 2, pp. 77-89, 2020.
@article{Mazurek2020sotc,
title = {Satisfaction of the condition of order preservation: A simulation study.},
author = {J. Mazurek and K. Kułakowski},
url = {https://journals.indexcopernicus.com/search/article?articleId=2669489},
doi = {10.37190/ord200205},
year = {2020},
date = {2020-01-01},
journal = {Operations Research and Decisions},
volume = {30},
number = {2},
pages = {77-89},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Prusak, A.; Kułakowski, K.; Szybowski, J.
Analiza porównawcza badania ryzyka technologicznego w projektach badawczo-rozwojowych przedsiębiorstw Proceedings Article
In: Modelowanie preferencji a ryzyko '19–'20, 2020, ISBN: 978-83-7875-646-0.
@inproceedings{Prusak2020apbr,
title = {Analiza porównawcza badania ryzyka technologicznego w projektach badawczo-rozwojowych przedsiębiorstw},
author = {A. Prusak and K. Kułakowski and J. Szybowski},
isbn = {978-83-7875-646-0},
year = {2020},
date = {2020-01-01},
booktitle = {Modelowanie preferencji a ryzyko '19–'20},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
2019
Kułakowski, K.; Szybowski, J.; Prusak, A.
Towards quantification of incompleteness in the pairwise comparisons methods Journal Article
In: International Journal of Approximate Reasoning, vol. 115, pp. 221-234, 2019, ISSN: 0888-613X.
@article{Kulakowski2019tqoi,
title = {Towards quantification of incompleteness in the pairwise comparisons methods},
author = {K. Kułakowski and J. Szybowski and A. Prusak},
url = {http://www.sciencedirect.com/science/article/pii/S0888613X19301197},
doi = {https://doi.org/10.1016/j.ijar.2019.10.002},
issn = {0888-613X},
year = {2019},
date = {2019-10-15},
urldate = {2019-10-15},
journal = {International Journal of Approximate Reasoning},
volume = {115},
pages = {221-234},
abstract = {"Apart from consistency, the completeness of information is one of the key factors influencing data quality. In the case of the pairwise comparisons (PC) method, much space in the literature is devoted to the quantitative analysis of this first idea, while the second issue has not been properly studied. The presented article is an attempt to bridge this gap. The aim of the article is to examine how the incompleteness of a set of paired comparisons influences the sensitivity of the PC method. During the research, two important factors related to the incompleteness of PC matrices have been identified, namely the number of missing pairwise comparisons and their arrangements. Accordingly, an easy-to-calculate incompleteness index have been developed. It takes into account both the total number of missing data and their distribution in the PC matrix. During the series of Montecarlo experiments, the properties of this index have been examined. It demonstrated that both the incompleteness and inconsistency of data almost equally contribute to the sensitivity of the PC matrix. The relative simplicity of the proposed index may help decision makers to quickly estimate the impact of missing comparisons on the quality of final results."},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
"Apart from consistency, the completeness of information is one of the key factors influencing data quality. In the case of the pairwise comparisons (PC) method, much space in the literature is devoted to the quantitative analysis of this first idea, while the second issue has not been properly studied. The presented article is an attempt to bridge this gap. The aim of the article is to examine how the incompleteness of a set of paired comparisons influences the sensitivity of the PC method. During the research, two important factors related to the incompleteness of PC matrices have been identified, namely the number of missing pairwise comparisons and their arrangements. Accordingly, an easy-to-calculate incompleteness index have been developed. It takes into account both the total number of missing data and their distribution in the PC matrix. During the series of Montecarlo experiments, the properties of this index have been examined. It demonstrated that both the incompleteness and inconsistency of data almost equally contribute to the sensitivity of the PC matrix. The relative simplicity of the proposed index may help decision makers to quickly estimate the impact of missing comparisons on the quality of final results."
Christopher, K.; Soltys, M.; Kułakowski, K.
Approximating consistency in pairwise comparisons Journal Article
In: Procedia Computer Science, pp. 1–10, 2019.
@article{Christopher2019acip,
title = {Approximating consistency in pairwise comparisons},
author = {K. Christopher and M. Soltys and K. Kułakowski},
url = {https://www.sciencedirect.com/science/article/pii/S1877050919314279},
doi = {https://doi.org/10.1016/j.procs.2019.09.240},
year = {2019},
date = {2019-04-01},
urldate = {2019-04-01},
journal = {Procedia Computer Science},
pages = {1–10},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.; Mazurek, J.; Ramík, J.; Soltys, M.
When is the condition of order preservation met? Journal Article
In: European Journal of Operational Research, vol. 277, no. 1, pp. 248 - 254, 2019, ISSN: 0377-2217.
@article{Kulakowski2019witc,
title = {When is the condition of order preservation met?},
author = {K. Kułakowski and J. Mazurek and J. Ramík and M. Soltys},
url = {http://www.sciencedirect.com/science/article/pii/S0377221719300815},
doi = {https://doi.org/10.1016/j.ejor.2019.01.046},
issn = {0377-2217},
year = {2019},
date = {2019-01-01},
urldate = {2019-01-01},
journal = {European Journal of Operational Research},
volume = {277},
number = {1},
pages = {248 - 254},
abstract = {This article explores the relationship between inconsistency in the pairwise comparisons method and conditions of order preservation. A pairwise comparisons matrix with elements from an alo-group (an Abelian, linearly ordered group) is investigated. This approach allows for a generalization of previous results. Sufficient conditions for order preservation based on the properties of elements of pairwise comparisons matrix are derived. Elucidating numerical examples are presented.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This article explores the relationship between inconsistency in the pairwise comparisons method and conditions of order preservation. A pairwise comparisons matrix with elements from an alo-group (an Abelian, linearly ordered group) is investigated. This approach allows for a generalization of previous results. Sufficient conditions for order preservation based on the properties of elements of pairwise comparisons matrix are derived. Elucidating numerical examples are presented.
Bodzon-Kułakowska, A.; Padrtova, T.; Drabik, A.; Ner-Kluza, J.; Antolak, A.; Kułakowski, K.; Suder, P.
Morphinome Database – The database of proteins altered by morphine administration – An update Journal Article
In: Journal of Proteomics, vol. 190, pp. 21 - 26, 2019, ISSN: 1874-3919, (Proteomics in chronic pain; investigating mechanistic markers of pain).
@article{BodzonKulakowska2019mdtd,
title = {Morphinome Database – The database of proteins altered by morphine administration – An update},
author = {A. Bodzon-Kułakowska and T. Padrtova and A. Drabik and J. Ner-Kluza and A. Antolak and K. Kułakowski and P. Suder},
url = {http://www.sciencedirect.com/science/article/pii/S1874391918301714},
doi = {https://doi.org/10.1016/j.jprot.2018.04.013},
issn = {1874-3919},
year = {2019},
date = {2019-01-01},
urldate = {2019-01-01},
journal = {Journal of Proteomics},
volume = {190},
pages = {21 - 26},
abstract = {Morphine is considered a gold standard in pain treatment. Nevertheless, its use could be associated with severe side effects, including drug addiction. Thus, it is very important to understand the molecular mechanism of morphine action in order to develop new methods of pain therapy, or at least to attenuate the side effects of opioids usage. Proteomics allows for the indication of proteins involved in certain biological processes, but the number of items identified in a single study is usually overwhelming. Thus, researchers face the difficult problem of choosing the proteins which are really important for the investigated processes and worth further studies. Therefore, based on the 29 published articles, we created a database of proteins regulated by morphine administration – The Morphinome Database (addiction-proteomics.org). This web tool allows for indicating proteins that were identified during different proteomics studies. Moreover, the collection and organization of such a vast amount of data allows us to find the same proteins that were identified in various studies and to create their ranking, based on the frequency of their identification. STRING and KEGG databases indicated metabolic pathways which those molecules are involved in. This means that those molecular pathways seem to be strongly affected by morphine administration and could be important targets for further investigations.
Significance
The data about proteins identified by different proteomics studies of molecular changes caused by morphine administration (29 published articles) were gathered in the Morphinome Database. Unification of those data allowed for the identification of proteins that were indicated several times by distinct proteomics studies, which means that they seem to be very well verified and important for the entire process. Those proteins might be now considered promising aims for more detailed studies of their role in the molecular mechanism of morphine action.},
note = {Proteomics in chronic pain; investigating mechanistic markers of pain},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Morphine is considered a gold standard in pain treatment. Nevertheless, its use could be associated with severe side effects, including drug addiction. Thus, it is very important to understand the molecular mechanism of morphine action in order to develop new methods of pain therapy, or at least to attenuate the side effects of opioids usage. Proteomics allows for the indication of proteins involved in certain biological processes, but the number of items identified in a single study is usually overwhelming. Thus, researchers face the difficult problem of choosing the proteins which are really important for the investigated processes and worth further studies. Therefore, based on the 29 published articles, we created a database of proteins regulated by morphine administration – The Morphinome Database (addiction-proteomics.org). This web tool allows for indicating proteins that were identified during different proteomics studies. Moreover, the collection and organization of such a vast amount of data allows us to find the same proteins that were identified in various studies and to create their ranking, based on the frequency of their identification. STRING and KEGG databases indicated metabolic pathways which those molecules are involved in. This means that those molecular pathways seem to be strongly affected by morphine administration and could be important targets for further investigations.
Significance
The data about proteins identified by different proteomics studies of molecular changes caused by morphine administration (29 published articles) were gathered in the Morphinome Database. Unification of those data allowed for the identification of proteins that were indicated several times by distinct proteomics studies, which means that they seem to be very well verified and important for the entire process. Those proteins might be now considered promising aims for more detailed studies of their role in the molecular mechanism of morphine action.
Significance
The data about proteins identified by different proteomics studies of molecular changes caused by morphine administration (29 published articles) were gathered in the Morphinome Database. Unification of those data allowed for the identification of proteins that were indicated several times by distinct proteomics studies, which means that they seem to be very well verified and important for the entire process. Those proteins might be now considered promising aims for more detailed studies of their role in the molecular mechanism of morphine action.
Kułakowski, K.; Talaga, D.
Inconsistency indices for incomplete pairwise comparisons matrices Journal Article
In: CoRR, vol. abs/1903.11873, 2019.
@article{kulakowski2019iifi,
title = {Inconsistency indices for incomplete pairwise comparisons matrices},
author = {K. Kułakowski and D. Talaga},
url = {http://arxiv.org/abs/1903.11873},
year = {2019},
date = {2019-01-01},
urldate = {2019-01-01},
journal = {CoRR},
volume = {abs/1903.11873},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
On the geometric mean method for incomplete pairwise comparisons Journal Article
In: CoRR, vol. abs/1905.04609, 2019.
@article{kulakowski2019otgm,
title = {On the geometric mean method for incomplete pairwise comparisons},
author = {K. Kułakowski},
url = {https://arxiv.org/abs/1905.04609},
year = {2019},
date = {2019-01-01},
urldate = {2019-01-01},
journal = {CoRR},
volume = {abs/1905.04609},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2018
Kułakowski, K.; Prusak, A.; Szybowski, J.
Towards quantification of incompleteness in the pairwise comparisons method Journal Article
In: CoRR, vol. abs/1812.03589, 2018.
@article{Kulakowski2018tqoi,
title = {Towards quantification of incompleteness in the pairwise comparisons method},
author = {K. Kułakowski and A. Prusak and J. Szybowski},
url = {http://arxiv.org/abs/1812.03589},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
journal = {CoRR},
volume = {abs/1812.03589},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.; Mazurek, J.; Ramik, J.; Soltys, M.
When condition of order preservation is met? Journal Article
In: CoRR, vol. abs/1802.02397, 2018.
@article{Kulakowski2018wcoo,
title = {When condition of order preservation is met?},
author = {K. Kułakowski and J. Mazurek and J. Ramik and M. Soltys},
url = {http://arxiv.org/abs/1802.02397},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
journal = {CoRR},
volume = {abs/1802.02397},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
Inconsistency in the ordinal pairwise comparisons method with and without ties Journal Article
In: European Journal of Operational Research, vol. 270, no. 1, pp. 314 - 327, 2018, ISSN: 0377-2217.
@article{Kulakowski2018iito,
title = {Inconsistency in the ordinal pairwise comparisons method with and without ties},
author = {K. Kułakowski},
url = {http://www.sciencedirect.com/science/article/pii/S0377221718302522},
doi = {https://doi.org/10.1016/j.ejor.2018.03.024},
issn = {0377-2217},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
journal = {European Journal of Operational Research},
volume = {270},
number = {1},
pages = {314 - 327},
abstract = {Comparing alternatives in pairs is a well-known method used to create ranking. Experts are asked to perform a series of binary comparisons and then, using mathematical methods, the final ranking is constructed. Experts conduct a series of single assessments, however, they may not always be consistent. The level of inconsistency among individual assessments is widely accepted as a measure of the ranking quality. The higher the ranking quality, the higher its credibility. One of the earliest and most widespread inconsistency indices is the consistency coefficient defined by Kendall and Babington Smith. In their work, the authors consider binary pairwise comparisons, i.e., those where the result of an individual comparison can only be better or worse. In the presented work, the maximal number of inconsistent triads in the set of ordinal pairwise comparisons with ties of arbitrary size is determined (formula 14). This, in turn, opens the possibility of effectively extending the Kendall and Babington Smith index to pairwise comparisons, where the result of an individual comparison can be: better, worse or equal. Hence, this effectively extends the use of this index to the Analytic Hierarchy Process and other quantitative methods based on comparing alternatives in pairs. The work also introduces the notions of a generalized tournament and a double tournament as graphs that model ordinal pairwise comparisons with ties and the maximally inconsistent set of pairwise comparisons with ties, respectively. The relationship between the most inconsistent set of pairwise comparisons with ties and the set cover problem is also shown.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Comparing alternatives in pairs is a well-known method used to create ranking. Experts are asked to perform a series of binary comparisons and then, using mathematical methods, the final ranking is constructed. Experts conduct a series of single assessments, however, they may not always be consistent. The level of inconsistency among individual assessments is widely accepted as a measure of the ranking quality. The higher the ranking quality, the higher its credibility. One of the earliest and most widespread inconsistency indices is the consistency coefficient defined by Kendall and Babington Smith. In their work, the authors consider binary pairwise comparisons, i.e., those where the result of an individual comparison can only be better or worse. In the presented work, the maximal number of inconsistent triads in the set of ordinal pairwise comparisons with ties of arbitrary size is determined (formula 14). This, in turn, opens the possibility of effectively extending the Kendall and Babington Smith index to pairwise comparisons, where the result of an individual comparison can be: better, worse or equal. Hence, this effectively extends the use of this index to the Analytic Hierarchy Process and other quantitative methods based on comparing alternatives in pairs. The work also introduces the notions of a generalized tournament and a double tournament as graphs that model ordinal pairwise comparisons with ties and the maximally inconsistent set of pairwise comparisons with ties, respectively. The relationship between the most inconsistent set of pairwise comparisons with ties and the set cover problem is also shown.
2017
Kułakowski, K.
Inconsistency in the ordinal pairwise comparisons method with and without ties Journal Article
In: CoRR, vol. abs/1702.01126, 2017.
@article{Kulakowski2017iito,
title = {Inconsistency in the ordinal pairwise comparisons method with and without ties},
author = {K. Kułakowski},
url = {http://arxiv.org/abs/1702.01126},
year = {2017},
date = {2017-01-01},
urldate = {2017-01-01},
journal = {CoRR},
volume = {abs/1702.01126},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2016
Kułakowski, K.; Kędzior, A.
Some Remarks on the Mean-Based Prioritization Methods in AHP Book Chapter
In: Nguyen, Ngoc-Thanh; Iliadis, Lazaros; Manolopoulos, Yannis; Trawiński, Bogdan (Ed.): Computational Collective Intelligence: 8th International Conference, ICCCI 2016, Halkidiki, Greece, September 28-30, 2016. Proceedings, Part I, pp. 434–443, Springer International Publishing, 2016, ISBN: 978-3-319-45243-2.
@inbook{Kulakowski2016srot,
title = {Some Remarks on the Mean-Based Prioritization Methods in AHP},
author = {K. Kułakowski and A. Kędzior},
editor = {Ngoc-Thanh Nguyen and Lazaros Iliadis and Yannis Manolopoulos and Bogdan Trawiński},
url = {http://dx.doi.org/10.1007/978-3-319-45243-2_40},
doi = {10.1007/978-3-319-45243-2_40},
isbn = {978-3-319-45243-2},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
booktitle = {Computational Collective Intelligence: 8th International Conference, ICCCI 2016, Halkidiki, Greece, September 28-30, 2016. Proceedings, Part I},
pages = {434–443},
publisher = {Springer International Publishing},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Saaty, T. L.; Kułakowski, K.
Axioms of the Analytic Hierarchy Process (AHP) and its Generalization to Dependence and Feedback: The Analytic Network Process (ANP) Journal Article
In: CoRR, vol. abs/1605.05777, 2016.
@article{Saaty2016aota,
title = {Axioms of the Analytic Hierarchy Process (AHP) and its Generalization to Dependence and Feedback: The Analytic Network Process (ANP)},
author = {T. L. Saaty and K. Kułakowski},
url = {http://arxiv.org/abs/1605.05777},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
journal = {CoRR},
volume = {abs/1605.05777},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Janicki, R.; Kułakowski, K.
Theory and Practice of Pairwise Comparisons: Preface Journal Article
In: Fundamenta Informaticae, vol. 144, no. 3-4, pp. i-iii, 2016.
@article{Janicki2016tapo,
title = {Theory and Practice of Pairwise Comparisons: Preface},
author = {R. Janicki and K. Kułakowski},
url = {http://content.iospress.com/journals/fundamenta-informaticae/144/3-4},
year = {2016},
date = {2016-01-01},
journal = {Fundamenta Informaticae},
volume = {144},
number = {3-4},
pages = {i-iii},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
Notes on the existence of a solution in the pairwise comparisons method using the heuristic rating estimation approach Journal Article
In: Annals of Mathematics and Artificial Intelligence, vol. 77, no. 1, pp. 105–121, 2016, ISSN: 1573-7470.
@article{Kulakowski2016note,
title = {Notes on the existence of a solution in the pairwise comparisons method using the heuristic rating estimation approach},
author = {K. Kułakowski},
url = {http://dx.doi.org/10.1007/s10472-015-9474-6},
doi = {10.1007/s10472-015-9474-6},
issn = {1573-7470},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {77},
number = {1},
pages = {105–121},
abstract = {Pairwise comparisons (PC) is a well-known method for modeling the subjective preferences of a decision maker. The method is very often used in the models of voting systems, social choice theory, decision techniques (such as AHP - Analytic Hierarchy Process) or multi-agent AI systems. In this approach, a set of paired comparisons is transformed into one overall ranking of alternatives. Very often, only the results of individual comparisons are given, whilst the weights (indicators of significance) of the alternatives need to be computed. According to Heuristic Rating Estimation (HRE), the new approach discussed in the article, besides the results of comparisons, the weights of some alternatives can also be a priori known. Although HRE uses a similar method to the popular AHP technique to compute the weights of individual alternatives, the solution obtained is not always positive and real. This article tries to answer the question of when such a correct solution exists. Hence, the sufficient condition for the existence of a positive and real solution in the HRE approach is formulated and proven. The influence of inconsistency in the paired comparisons set for the existence of a solution is also discussed.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Pairwise comparisons (PC) is a well-known method for modeling the subjective preferences of a decision maker. The method is very often used in the models of voting systems, social choice theory, decision techniques (such as AHP - Analytic Hierarchy Process) or multi-agent AI systems. In this approach, a set of paired comparisons is transformed into one overall ranking of alternatives. Very often, only the results of individual comparisons are given, whilst the weights (indicators of significance) of the alternatives need to be computed. According to Heuristic Rating Estimation (HRE), the new approach discussed in the article, besides the results of comparisons, the weights of some alternatives can also be a priori known. Although HRE uses a similar method to the popular AHP technique to compute the weights of individual alternatives, the solution obtained is not always positive and real. This article tries to answer the question of when such a correct solution exists. Hence, the sufficient condition for the existence of a positive and real solution in the HRE approach is formulated and proven. The influence of inconsistency in the paired comparisons set for the existence of a solution is also discussed.
2015
Kułakowski, K.
On the Properties of the Priority Deriving Procedure in the Pairwise Comparisons Method Journal Article
In: Fundamenta Informaticae, vol. 139, no. 4, pp. 403 - 419, 2015.
@article{Kulakowski2015otpo,
title = {On the Properties of the Priority Deriving Procedure in the Pairwise Comparisons Method},
author = {K. Kułakowski},
doi = {10.3233/FI-2015-1240},
year = {2015},
date = {2015-07-01},
journal = {Fundamenta Informaticae},
volume = {139},
number = {4},
pages = {403 - 419},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kulakowski, K.
Dynamic concurrent van Emde Boas array Journal Article
In: CoRR, vol. abs/1509.06948, 2015.
@article{Kulakowski2015dcve,
title = {Dynamic concurrent van Emde Boas array},
author = {K. Kulakowski},
url = {http://arxiv.org/abs/1509.06948},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
journal = {CoRR},
volume = {abs/1509.06948},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
Notes on Order Preservation and Consistency in AHP Journal Article
In: European Journal of Operational Research, vol. 245, no. 1, pp. 333–337, 2015.
@article{Kulakowski2015noop,
title = {Notes on Order Preservation and Consistency in AHP},
author = {K. Kułakowski},
url = {http://dx.doi.org/10.1016/j.ejor.2015.03.010},
doi = {10.1016/j.ejor.2015.03.010},
year = {2015},
date = {2015-01-01},
journal = {European Journal of Operational Research},
volume = {245},
number = {1},
pages = {333–337},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.; Grobler-Dębska, K.; Wąs, J.
Heuristic rating estimation: geometric approach Journal Article
In: Journal of Global Optimization, vol. 62, no. 3, pp. 529-543, 2015, ISSN: 0925-5001.
@article{Kulakowski2015hreg,
title = {Heuristic rating estimation: geometric approach},
author = {K. Kułakowski and K. Grobler-Dębska and J. Wąs},
url = {http://dx.doi.org/10.1007/s10898-014-0253-4},
doi = {10.1007/s10898-014-0253-4},
issn = {0925-5001},
year = {2015},
date = {2015-01-01},
journal = {Journal of Global Optimization},
volume = {62},
number = {3},
pages = {529-543},
publisher = {Springer US},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
Erratum to: A heuristic rating estimation algorithm for the pairwise comparisons method Journal Article
In: Central European Journal of Operations Research, pp. 1-3, 2015, ISSN: 1435-246X.
@article{Kulakowski2015etah,
title = {Erratum to: A heuristic rating estimation algorithm for the pairwise comparisons method},
author = {K. Kułakowski},
url = {http://dx.doi.org/10.1007/s10100-015-0396-5},
doi = {10.1007/s10100-015-0396-5},
issn = {1435-246X},
year = {2015},
date = {2015-01-01},
journal = {Central European Journal of Operations Research},
pages = {1-3},
publisher = {Springer Berlin Heidelberg},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
A heuristic rating estimation algorithm for the pairwise comparisons method Journal Article
In: Central European Journal of Operations Research, vol. 23, no. 1, pp. 187-203, 2015, ISSN: 1435-246X.
@article{Kulakowski2015ahre,
title = {A heuristic rating estimation algorithm for the pairwise comparisons method},
author = {K. Kułakowski},
url = {http://dx.doi.org/10.1007/s10100-013-0311-x},
doi = {10.1007/s10100-013-0311-x},
issn = {1435-246X},
year = {2015},
date = {2015-01-01},
journal = {Central European Journal of Operations Research},
volume = {23},
number = {1},
pages = {187-203},
publisher = {Springer-Verlag},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.; Juszczyk, R.; Ernst, S.
A Concurrent Inconsistency Reduction Algorithm for the Pairwise Comparisons Method` Proceedings Article
In: Artificial Intelligence and Soft Computing, pp. 214–222, 2015.
@inproceedings{Kulakowski2015acir,
title = {A Concurrent Inconsistency Reduction Algorithm for the Pairwise Comparisons Method`},
author = {K. Kułakowski and R. Juszczyk and S. Ernst},
year = {2015},
date = {2015-01-01},
booktitle = {Artificial Intelligence and Soft Computing},
journal = {Lecture Notes in Computer Science},
volume = {II},
number = {9120},
pages = {214–222},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
2014
Kułakowski, K.; Matyasik, P.; Ernst, S.
Modeling Indoor Lighting Inspection Robot Behavior Using Concurrent Communicating Lists Journal Article
In: Expert Syst. Appl., vol. 41, no. 4, pp. 984–989, 2014, ISSN: 0957-4174.
@article{Kulakowski2014mili,
title = {Modeling Indoor Lighting Inspection Robot Behavior Using Concurrent Communicating Lists},
author = {K. Kułakowski and P. Matyasik and S. Ernst},
url = {http://dx.doi.org/10.1016/j.eswa.2013.06.065},
doi = {10.1016/j.eswa.2013.06.065},
issn = {0957-4174},
year = {2014},
date = {2014-03-01},
journal = {Expert Syst. Appl.},
volume = {41},
number = {4},
pages = {984–989},
publisher = {Pergamon Press, Inc.},
address = {Tarrytown, NY, USA},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Koczkodaj, W. W.; Kułakowski, K.; Ligęza, A.
On the quality evaluation of scientific entities in Poland supported by consistency-driven pairwise comparisons method Journal Article
In: Scientometrics, vol. 99, no. 3, pp. 911-926, 2014, ISSN: 0138-9130.
@article{Koczkodaj2014otqe,
title = {On the quality evaluation of scientific entities in Poland supported by consistency-driven pairwise comparisons method},
author = {W. W. Koczkodaj and K. Kułakowski and A. Ligęza},
url = {http://dx.doi.org/10.1007/s11192-014-1258-y},
doi = {10.1007/s11192-014-1258-y},
issn = {0138-9130},
year = {2014},
date = {2014-01-01},
journal = {Scientometrics},
volume = {99},
number = {3},
pages = {911-926},
publisher = {Springer Netherlands},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.
A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative Journal Article
In: Concurrency and Computation: Practice and Experience, vol. 26, no. 2, pp. 360–379, 2014, ISSN: 1532-0634.
@article{Kulakowski2014acve,
title = {A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative},
author = {K. Kułakowski},
url = {http://dx.doi.org/10.1002/cpe.2995},
doi = {10.1002/cpe.2995},
issn = {1532-0634},
year = {2014},
date = {2014-01-01},
journal = {Concurrency and Computation: Practice and Experience},
volume = {26},
number = {2},
pages = {360–379},
abstract = {Increasing demand for computationally efficient algorithms and processors has turned the attention of researchers toward parallel and concurrent solutions. Because the frequency of contemporary processors cannot be tweaked infinitely, the only hopes for squeezing more performance from computers are parallel processing and parallel computation. The important part of every parallel solution is concurrent data structures, which allow multithread programming environments to be taken advantage of. In this article, a new concurrent dynamic set structure is proposed. It is based on the van Emde Boas trees concept, where on every node of a tree, an array of the node's children is stored. The structure is equipped with a simple but effective locking algorithm, which allows it to be used concurrently by any number of threads. The presented algorithm idea is accompanied by an experimental implementation written in JAVA 6. Preliminary tests prove that, especially for moderately larger data sets with a predominance of read operations, the concurrent van Emde Boas array proposed in this article may be a viable alternative for other structures providing a similar functionality. Copyright © 2013 John Wiley & Sons, Ltd.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Increasing demand for computationally efficient algorithms and processors has turned the attention of researchers toward parallel and concurrent solutions. Because the frequency of contemporary processors cannot be tweaked infinitely, the only hopes for squeezing more performance from computers are parallel processing and parallel computation. The important part of every parallel solution is concurrent data structures, which allow multithread programming environments to be taken advantage of. In this article, a new concurrent dynamic set structure is proposed. It is based on the van Emde Boas trees concept, where on every node of a tree, an array of the node's children is stored. The structure is equipped with a simple but effective locking algorithm, which allows it to be used concurrently by any number of threads. The presented algorithm idea is accompanied by an experimental implementation written in JAVA 6. Preliminary tests prove that, especially for moderately larger data sets with a predominance of read operations, the concurrent van Emde Boas array proposed in this article may be a viable alternative for other structures providing a similar functionality. Copyright © 2013 John Wiley & Sons, Ltd.
Kułakowski, K.
Heuristic Rating Estimation Approach to The Pairwise Comparisons Method Journal Article
In: Fundamenta Informaticae, vol. 133, pp. 367-386, 2014.
@article{Kulakowski2014hrea,
title = {Heuristic Rating Estimation Approach to The Pairwise Comparisons Method},
author = {K. Kułakowski},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi133-4-03},
doi = {10.3233/FI-2014-1081},
year = {2014},
date = {2014-01-01},
journal = {Fundamenta Informaticae},
volume = {133},
pages = {367-386},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Kułakowski, K.; Szybowski, J.
The New Triad based Inconsistency Indices for Pairwise Comparisons Journal Article
In: Procedia Computer Science, vol. 35, no. 0, pp. 1132 - 1137, 2014, ISSN: 1877-0509.
@article{Kulakowski2014tntb,
title = {The New Triad based Inconsistency Indices for Pairwise Comparisons},
author = {K. Kułakowski and J. Szybowski},
url = {http://www.sciencedirect.com/science/article/pii/S1877050914011703},
doi = {http://dx.doi.org/10.1016/j.procs.2014.08.205},
issn = {1877-0509},
year = {2014},
date = {2014-01-01},
journal = {Procedia Computer Science},
volume = {35},
number = {0},
pages = {1132 - 1137},
abstract = {Abstract Pairwise comparisons are widely recognized method supporting decision making process based on the subjective judgments. The key to this method is the notion of inconsistency that has a significant impact on the reliability of results. Inconsistency is expressed by means of inconsistency indices. Depending on their construction, such indices may pay attention to different aspects of the set of pairwise comparisons. The family of indices proposed in this article tries to combine the advantages coming from different indices, thereby increases the expressiveness of the family elements. The newly introduced notion of equivalence can help in comparing the indices and identifying their common properties.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Abstract Pairwise comparisons are widely recognized method supporting decision making process based on the subjective judgments. The key to this method is the notion of inconsistency that has a significant impact on the reliability of results. Inconsistency is expressed by means of inconsistency indices. Depending on their construction, such indices may pay attention to different aspects of the set of pairwise comparisons. The family of indices proposed in this article tries to combine the advantages coming from different indices, thereby increases the expressiveness of the family elements. The newly introduced notion of equivalence can help in comparing the indices and identifying their common properties.