Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact Factor 2024: 0.4
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.
Authors: Janicki, Ryszard | Kułakowski, Konrad
Article Type: Other
DOI: 10.3233/FI-2016-1329
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. i-iii, 2016
Authors: Saaty, Thomas L.
Article Type: Research Article
Abstract: One often assumes that comparisons are discrete and carried out in a matrix of numbers. However, our eyes and other senses perform comparisons in a continuous way by making many simultaneously. Here the mathematics of pairwise comparisons is generalized to the continuous case. It is more likely that in evolution, little creatures had and now still have a “feeling” about the environment in which they find themselves by sensing many things at once. Through evolution, sensing has been transformed to thinking and to discrete comparisons. This paper presents some material from other works written about continuous comparisons.
Keywords: Pairwise comparisons, continuous comparisons, systems of equations, Fredholm’s equation of the second kind, eigenvectors and eigenfunctions
DOI: 10.3233/FI-2016-1330
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 213-221, 2016
Authors: Sandrasagra, Barbara | Soltys, Michael
Article Type: Research Article
Abstract: We propose a research program for developing a formal framework for ranking procedures based on the Pairwise Comparisons method. We are interested in the case where relatively few items are to be ranked with a complex procedure and according to a large number of criteria. A typical example of this scenario is a competition where several companies bid for a contract, and where the selection of the winner is done with multiple criteria according to an intricate selection procedure. Several other applications are suggested.
DOI: 10.3233/FI-2016-1331
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 223-240, 2016
Authors: Schumann, Andrew | Woleński, Jan
Article Type: Research Article
Abstract: This paper examines two main possibilities of pairwise comparisons analysis: first, pairwise comparisons within a lattice, in this case these comparisons can be measurable by numbers; second, comparisons beyond any lattice, in this case these comparisons cannot be measurable in principle. We show that the first approach to pairwise comparisons analysis is based on the conventional square of opposition and its generalization, but the second approach is based on unconventional squares of opposition. Furthermore, the first approach corresponds to lateral inhibition in transmission signals and the second approach corresponds to lateral activation in transmission signals.
Keywords: Logical relations, logical square, logical hexagon, logical octagon, lateral inhibition, lateral activation, pairwise comparison
DOI: 10.3233/FI-2016-1332
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 241-254, 2016
Authors: Pérez, Joaquín | Mokotoff, Ethel
Article Type: Research Article
Abstract: This paper shows an example of strong rank reversal in group decision making. Decision makers have preferences expressed through a reciprocal paired comparison matrix. Every one of them applies the eigenvector priority function to her paired comparison matrix to obtain her individual priority vector and then a group priority vector is computed by any of the following two procedures: a) Averaging the already computed individual priority vectors, and b) Averaging the entries of the comparison matrices to obtain a group comparison matrix, and applying to it the eigenvector priority function. Strong rank reversal means that there is one alternative that …has the highest priority for every decision maker, and consequently the highest priority in the averaged priority vector obtained by procedure (a), but loses such highest priority when procedure (b) is applied. Show more
Keywords: Rank Reversal, Paired Comparison Matrix, Reciprocal matrix, AHP
DOI: 10.3233/FI-2016-1333
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 255-261, 2016
Authors: Choo, Eng U. | Wedley, William C. | Wijnmalen, Diederik J.D.
Article Type: Research Article
Abstract: A ratio pairwise comparison matrix estimates another matrix of true ratios between objects. From the pairwise comparison matrix, various methods are used to derive a priority vector and associated consistent matrix that also estimates the matrix of true ratios. The distance from the consistent matrix and the true matrix measures the accuracy of a method. The geometric mean is shown to be the only method with error below a basic threshold while being invariant to any reordering and rescaling of columns. Besides being simple to calculate, the geometric mean has excellent performance and many desirable properties.
Keywords: Ratio scale preferences, pairwise ratio comparisons, relevant ratio information
DOI: 10.3233/FI-2016-1334
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 263-278, 2016
Authors: Ábele-Nagy, Kristóf | Bozóki, Sándor
Article Type: Research Article
Abstract: Efficiency, the basic concept of multi-objective optimization is investigated for the class of pairwise comparison matrices. A weight vector is called efficient if no alternative weight vector exists such that every pairwise ratio of the latter’s components is at least as close to the corresponding element of the pairwise comparison matrix as the one of the former’s components is, and the latter’s approximation is strictly better in at least one position. A pairwise comparison matrix is called simple perturbed if it differs from a consistent pairwise comparison matrix in one element and its reciprocal. One of the classical weighting methods, …the eigenvector method is analyzed. It is shown in the paper that the principal right eigenvector of a simple perturbed pairwise comparison matrix is efficient. An open problem is exposed: the search for a necessary and sufficient condition of that the principal right eigenvector is efficient. Show more
Keywords: pairwise comparison matrix, efficiency, Pareto optimality, eigenvector
DOI: 10.3233/FI-2016-1335
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 279-289, 2016
Authors: Koczkodaj, Waldemar W. | Mikhailov, Ludmil | Redlarski, Grzegorz | Soltys, Michael | Szybowski, Jacek | Tamazian, Gaik | Wajch, Eliza | Yuen, Kevin Kam Fung
Article Type: Research Article
Abstract: This study has been inspired by numerous requests for clarification from researchers who often confuse Saaty’s Analytic Hierarchy Process (AHP) with the pairwise comparisons (PC) method, taking AHP as the only representation of PC. This study should be regarded as an interpretation and clarification of past investigations of PC. In addition, this article is a reflection on general PC research at a higher level of abstraction: the philosophy of science. It delves into the foundations and implications of pairwise comparisons. Some results of this study are based on a recently published work by Koczkodaj and Szwarc. Finally, open problems have …also been reported for future research. Show more
Keywords: pairwise comparisons, inconsistency analysis, ratio scale, approximation
DOI: 10.3233/FI-2016-1336
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 291-307, 2016
Authors: Csató, László | Rónyai, Lajos
Article Type: Research Article
Abstract: A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph. A weighting method satisfies the linear order preservation property if it always results in a ranking such that an alternative directly preferred to another does not have a lower rank. We study whether two procedures, the Eigenvector Method and the Logarithmic Least Squares Method meet this axiom. Both weighting methods break linear order preservation, moreover, the ranking according to the Eigenvector Method depends …on the incomplete pairwise comparison representation chosen. Show more
Keywords: Directed acyclic graph, incomplete pairwise comparison matrix, Eigenvector Method, Logarithmic Least Squares Method
DOI: 10.3233/FI-2016-1337
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 309-320, 2016
Authors: Brunelli, Matteo
Article Type: Research Article
Abstract: This paper recalls the definition of consistency for pairwise comparison matrices and briefly presents the concept of inconsistency index in connection to other aspects of the theory of pairwise comparisons. By commenting on a recent contribution by Koczkodaj and Szwarc, it will be shown that the discussion on inconsistency indices is far from being over, and the ground is still fertile for debates.
Keywords: Pairwise comparisons, valued preference relations, consistency, inconsistency index, analytic hierarchy process
DOI: 10.3233/FI-2016-1338
Citation: Fundamenta Informaticae, vol. 144, no. 3-4, pp. 321-332, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl