On the priority vector associated with a fuzzy preference relation and a multiplicative preference relation.

We propose two straightforward methods for deriving the priority vector associated with a fuzzy preference relation. Then, using transformations between multiplicative preference relations and fuzzy preference relations, we study the relationships between the priority vectors associated with these two types of preference relations.pairwise comparison matrix; fuzzy preference relation; priority vector

Using pairwise comparisons to determine consumer preferences in hotel selection

We consider the problem of evaluating preferences for criteria used by university students when selecting a hotel for accommodation during a professional development program in a foreign country. Input data for analysis come from a survey of 202 respondents, who indicated their age, sex and whether they have previously visited the country. The criteria under evaluation are location, accommodation cost, typical guests, free breakfast, room amenities and courtesy of staff. The respondents assess the criteria both directly by providing estimates of absolute ratings and ranks, and indirectly by relative estimates using ratios of pairwise comparisons. To improve the accuracy of ratings derived from pairwise comparisons, we concurrently apply the principal eigenvector method, the geometric mean method and the method of log-Chebyshev approximation. Then, the results from the direct and indirect evaluation of ratings and ranks are examined together to analyze how the results from pairwise comparisons may differ from each other and from the results of direct assessment by respondents. We apply statistical techniques, such as estimation of means, standard deviations and correlations, to the vectors of ratings and ranks provided directly or indirectly by respondents, and then use the estimates to make accurate assessment of the criteria under study.Comment: 27 pages, 16 table

A chi-square method for priority derivation in group decision making with incomplete reciprocal preference relations

This paper proposes a chi-square method (CSM) to obtain a priority vector for group decision making (GDM) problems where decision-makers’ (DMs’) assessment on alternatives is furnished as incomplete reciprocal preference relations with missing values. Relevant theorems and an iterative algorithm about CSM are proposed. Saaty’s consistency ratio concept is adapted to judge whether an incomplete reciprocal preference relation provided by a DM is of acceptable consistency. If its consistency is unacceptable, an algorithm is proposed to repair it until its consistency ratio reaches a satisfactory threshold. The repairing algorithm aims to rectify an inconsistent incomplete reciprocal preference relation to one with acceptable consistency in addition to preserving the initial preference information as much as possible. Finally, four examples are examined to illustrate the applicability and validity of the proposed method, and comparative analyses are provided to show its advantages over existing approaches

Incomplete pairwise comparative judgments: Recent developments and a proposed method

The current paper deals with incomplete Pairwise Comparisons (‘PWs’) when a large number of alternatives is evaluated. PWs are used to quantify decision maker's preferences, both ordinal and cardinal, in multi-criteria decision-making settings for eliciting the priorities of alternative options or weights of criteria. We use additive PWs with a different scale and show how 2-diagonal samples are used to deduce the implied weights thus prioritizing the alternatives. As a consequence, the number of PWs in incomplete judgment decision matrices is greatly reduced while preserving consistency and quality of the results. Computational results are provided and an example from the literature is applied to demonstrate the effectiveness of this method

A graph interpretation of the least squares ranking method

The paper aims at analyzing the least squares ranking method for generalized tournaments with possible missing and multiple paired comparisons. The bilateral relationships may reflect the outcomes of a sport competition, product comparisons, or evaluation of political candidates and policies. It is shown that the rating vector can be obtained as a limit point of an iterative process based on the scores in almost all cases. The calculation is interpreted on an undirected graph with loops attached to some nodes, revealing that the procedure takes into account not only the given object's results but also the strength of objects compared with it. We explore the connection between this method and another procedure defined for ranking the nodes in a digraph, the positional power measure. The decomposition of the least squares solution offers a number of ways to modify the method

Decentralized Riemannian Particle Filtering with Applications to Multi-Agent Localization

The primary focus of this research is to develop consistent nonlinear decentralized particle filtering approaches to the problem of multiple agent localization. A key aspect in our development is the use of Riemannian geometry to exploit the inherently non-Euclidean characteristics that are typical when considering multiple agent localization scenarios. A decentralized formulation is considered due to the practical advantages it provides over centralized fusion architectures. Inspiration is taken from the relatively new field of information geometry and the more established research field of computer vision. Differential geometric tools such as manifolds, geodesics, tangent spaces, exponential, and logarithmic mappings are used extensively to describe probabilistic quantities. Numerous probabilistic parameterizations were identified, settling on the efficient square-root probability density function parameterization. The square-root parameterization has the benefit of allowing filter calculations to be carried out on the well studied Riemannian unit hypersphere. A key advantage for selecting the unit hypersphere is that it permits closed-form calculations, a characteristic that is not shared by current solution approaches. Through the use of the Riemannian geometry of the unit hypersphere, we are able to demonstrate the ability to produce estimates that are not overly optimistic. Results are presented that clearly show the ability of the proposed approaches to outperform current state-of-the-art decentralized particle filtering methods. In particular, results are presented that emphasize the achievable improvement in estimation error, estimator consistency, and required computational burden