A typical approach to handle the complexity of multi-faceted decision-making problems is to use multiattribute decision-making (MADM) methods based on pairwise comparisons. Fuzzy set theory has also been employed to cope with the uncertainty and vagueness involved in conducting the comparisons between components of a decision model. An important issue regarding the reliability of the output is ...

This paper proposes an improved score function for the effective ranking order of interval-valued intuitionistic fuzzy sets (IVIFSs) and an interval-valued intuitionistic fuzzy TOPSIS method based on the score function to solve multicriteria decision-making problems in which all the preference information provided by decision-makers is expressed as interval-valued intuitionistic fuzzy decision ...

A large class of problems of sequential decision-making can be modeled as Markov or Semi-Markov Decision Problems, which can be solved by classical methods of dynamic programming. However, the computational complexity of the classical MDP algorithms, such as value iteration and policy iteration, is prohibitive and will grow intractably with the size of problems. Furthermore, they require for ea...

We propose Confusions over Time (CoT), a novel generative framework which facilitates a multi-granular analysis of the decision making process. The CoT not only models the confusions or error properties of individual decision makers and their evolution over time, but also allows us to obtain diagnostic insights into the collective decision making process in an interpretable manner. To this end,...

We consider the Hamiltonian cycle problem (HCP) embedded in a controlled Markov decision process. In this setting, HCP reduces to an optimization problem on a set of Markov chains corresponding to a given graph. We prove that Hamiltonian cycles are minimizers for the trace of the fundamental matrix on a set of all stochastic transition matrices. In case of doubly stochastic matrices with symmet...

Consistency retrieval from a biased relative preference table is an imperative task in decision theory This paper considers the least squares approximation of a pairwise comparison matrix by consistent matrices It is observed that the highly nonlinear manifold of consistent matrices can be changed into a linear subspace by the component wise logarithmic transformation A rst order optimality con...

according to the limit of resources in the subject of prioritization, one of the alternative methods is mcdm method. generally, mcdm models have been developed under certainty while we confront with under uncertainty in real world. in hierarchical mcdm methods, one of the main steps is to weigh criteria and computes each alternative weight using defined criteria in the next steps. one of the ea...

In some cases, the matrix available to the analyst/decision-maker is complete, but it is an invalid (not positive semi-definite) correlation matrix. There could be many reasons that give rise to such invalid matrices (Mishra, 2004). In such cases, the problem is to obtain a positive semi-definite approximate correlation matrix, which, in some sense, is closest to the given invalid matrix. A num...

Project selection is considered as an important problem in project management. It is multi-criteria in nature and is based on various quantitative and qualitative factors. The main purpose of this paper is to present a new rank-based method for project selection in outranking relation. According to this approach, decision alternatives were clustered in the concordance matrix and the discordance...

Despite their successes, what makes kernel methods difficult to use in many large scale problems is the fact that computing the decision function is typically expensive, especially at prediction time. In this paper, we overcome this difficulty by proposing Fastfood, an approximation that accelerates such computation significantly. Key to Fastfood is the observation that Hadamard matrices when c...