2008
DOI: 10.1016/j.ejor.2006.12.029
|View full text |Cite
|
Sign up to set email alerts
|

A sensitivity analysis algorithm for hierarchical decision models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
53
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 90 publications
(53 citation statements)
references
References 26 publications
0
53
0
Order By: Relevance
“…Such data, all the same, are often calculated less than a 100 % confidence level and subjected also to variations if the conditions change (Chen and Kocaoglu 2008). Meanwhile, owing to the type of an algorithm used at the core of the various judgment quantification techniques employed in HDM, they usually tend to produce different values of local contribution.…”
Section: Sensitivity Analysismentioning
confidence: 99%
“…Such data, all the same, are often calculated less than a 100 % confidence level and subjected also to variations if the conditions change (Chen and Kocaoglu 2008). Meanwhile, owing to the type of an algorithm used at the core of the various judgment quantification techniques employed in HDM, they usually tend to produce different values of local contribution.…”
Section: Sensitivity Analysismentioning
confidence: 99%
“…Chen [18] grouped sensitivity analysis into three main groups: numerical incremental analysis, probabilistic simulations, and mathematical models The numerical incremental analysis, also known as One-at-a-time (OAT) or "trial and error" works by incrementally changing one parameter at a time, finding the new solution and showing graphically how the ranks change. There exist several variations of this method by Barker [19] and Hurley [20].…”
Section: Sensitivity Analysismentioning
confidence: 99%
“…Moreover, in Hahn (2003) a stochastic characterization of the pairwise comparison judgments is provided, while statistical models for deriving the weights of the alternatives using Markov chain Monte Carlo are also presented. Furthermore, Farkas (2007) theoretically studied the conditions for rank reversal on perturbing the PWC matrices, while Chen and Kocaoglu (2008) also studied the rank reversal problem in this particular context, and came up with an algorithm to analyze the sensitivity of hierarchical decision models.…”
Section: Introductionmentioning
confidence: 99%