Search arXivSearch

arXiv · 1404.6981

Heuristic rating estimation - geometric approach

Abstract

Heuristic Rating Estimation (HRE) is a newly proposed method supporting decisions analysis based on the use of pairwise comparisons. It allows that the ranking values of some alternatives (herein referred to as concepts) are initially known, whilst the ranks for the other concepts have yet to be estimated. To calculate the missing ranks it is assumed that the priority of every single concept can be determined as the weighted arithmetic mean of priorities of all the other concepts. It has been shown that the problem has admissible solution if the inconsistency of pairwise comparisons is not too high. The proposed approach adopts the heuristics according to which to determine the missing priorities a weighted geometric mean is used. In this approach, despite an increased complexity, the solution always exists and their existence does not depend on the inconsistency of the input matrix. Thus, the presented approach might be appropriate for a larger number of problems than the previous method. The formal definition of the proposed geometric heuristics is accompanied by two numerical examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Konrad Kułakowski, Katarzyna Grobler-Dębska, Jarosław Wąs. 2014-04-28. Heuristic rating estimation - geometric approach. https://doi.org/10.1007/s10898-014-0253-4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

The parameterised complexity of generalised temporal domination on temporal graphs with modular structure

Inspired by the static problem $(α,β)$-Dominating Set, we propose a general temporal domination problem, called $(α,β)$-Temporal Dominating Set ($(α,β)$-TDS). We show that this problem encompasses Temporal Dominating Set, and additionally provides first temporal extensions of problems such as $k$-Dominating Set and $α$-Dominating Set. In this paper, we study the parameterised complexity of $(α,β)$-TDS with respect to temporal neighbourhood diversity (TND), temporal modular-width (TMW), and temporal cliquewidth (TCW). We obtain fixed parameter tractability results for all values of $α$ and $β$ with respect to TND; W[1]-hardness with respect to TMW and TCW whenever $β$ is in the problem input, or whenever $α\in (0,1)$ and $β$ is a fixed constant; and para-NP-hardness with respect to TCW when $α= 0$ and $β= 1$, or $α= 1$ and $β= 0$.

cs.DM