INFLUENCE OF MISSING ATTRIBUTES ON SELECTING A BEST MULTIATTRIBUTED ALTERNATIVE

Alternatives involving many factors arc difficult to evaluate because of multiple underlying competing objectives. If evaluation is based on an incomplete set of factors, and if the purpose of the evaluation is to select a single overall best alternative, inferior alternatives may be selected with surprising frequency and/or severe negative impact. At the same time, sensitivity analysis of evaluation scores based on statistical criteria can easily mask the impact and the frequency of selection of inferior alternatives. In this paper, criteria appropriate to reflect the decision impact are developed and both the frequency and impact of the selection of inferior alternatives are demonstrated empirically. Previous studies based on statistical criteria [1] [9] indicated minimal impact on overall evaluation and selection. This paper demonstrates that high statistical criterion values coexist with frequent and/or serious errors of selection.     

The inferring of preferences from indifferences in multicriteria decision analysis

Rivett [5] has proposed that an approximate preference ordering may be deduced from statements of pairwise indifferences between decision alternatives by using multi-dimensional scaling. In this paper it is demonstrated that much stronger evaluations of preference are possible by applying formal statistical inferential procedures to a simple parametric model, relating indifference to closeness on a scale defined by a linear function of attribute values. This can be used to screen out a considerable proportion of less desirable decision alternatives. The method is illustrated by application to Rivett's problem of the hypothetical Town of Brove, for which a satisfactory matching with Rivett's utilities is obtained. It is also shown that the method can provide useful preference orderings on the basis of less than 20% of all possible pairwise comparisons between alternatives.     

额外资源按需分配方法研究

文献Wei Quanling等^[1]的最后一段提出了这样一类额外资源分配问题：假设有一些额外的投入资源将要分配给全部或者部分决策单元,如果我们希望分配结果对于整个系统（该系统由全部决策单元组成）来说是最有益的,那么应当如何分配这些额外的投入资源?他们同时还指出系统中哪些决策单元能够获得额外的投入资源,这不仅取决于决策单元的效率,还需要考虑规模报酬。针对此类问题,本文提出一种额外资源按需分配方法：首先,综合决策单元的技术效率与其投影点的规模弹性构建发展曲线,并由决策单元的发展曲线获知其投入变动与产出变动的对应关系;然后,把额外资源分成若干等份,依次分配每一个等份的额外资源,每次分配使系统的总产出增加实现最大,直至分配完全部的额外资源,或者分配某一份额外资源不再带来任何的产出增加,分配就会停止;最后,把决策单元在每一次分配过程中获得的额外资源进行累加,得到这个决策单元最终的分配结果。全文的最后分别在"一个投入一个产出"和"两个投入一个产出"情况下给出两个具体的分配算例。分配结果表明,这种按需分配方法不会缩减任意一个决策单元当前占有的投入资源数量,并且还可以有效地在辨识出某种额外资源在规模上和结构上存在的冗余,从而有效地避免不必要的分配。     

RANK GENERATION,PRESERVATION, AND REVERSAL IN THE ANALYTIC HIERARCHY DECISION PROCESS

Decision making has the objective of finding the best alternative or set of alternatives by considering a number of goals, objectives, criteria, competitors, and other important factors. The analytic hierarchy process is a decision aid used to assist a decision maker in sorting out the complexity of a decision problem and making use of his or her judgments. A decision maker must be assured that the arithmetic operations of any such decision process are the right ones—that they surface the correct ranking and values of the alternatives and preserve or alter ranks appropriately when new alternatives are added or deleted. In this paper it will be shown that with absolute measurement, rank always is preserved, with relative measurement, rank changes with nspect to scveral criteria only because of the structural dependence (involving both numbers and measurements) of criteria on alternatives. A discussion of the effect on rank of replicas and near replicas of the alternatives also is given.     

PAHAP: A Pairwise Aggregated Hierarchical Analysis of Ratio-Scale Preferences

In this paper, we present a Pairwise Aggregated Hierarchical Analysis of Ratio-Scale Preferences (PAHAP), a new method for solving discrete alternative multicriteria decision problems. Following the Analytic Hierarchy Process (AHP), PAHAP uses pairwise preference judgments to assess the relative attractiveness of the alternatives. By first aggregating the pairwise judgment ratios of the alternatives across all criteria, and then synthesizing based on these aggregate measures, PAHAP determines overall ratio scale priorities and rankings of the alternatives which are not subject to rank reversal, provided that certain weak consistency requirements are satisfied. Hence, PAHAP can serve as a useful alternative to the original AHP if rank reversal is undesirable, for instance when the system is open and criterion scarcity does not affect the relative attractiveness of the alternatives. Moreover, the single matrix of pairwise aggregated ratings constructed in PAHAP provides useful insights into the decision maker's preference structure. PAHAP requires the same preference information as the original AHP (or, altematively, the same information as the Referenced AHP, if the criteria are compared based on average (total) value of the alternatives). As it is easier to implement and interpret than previously proposed variants of the conventional AHP which prevent rank reversal, PAHAP also appears attractive from a practitioner's viewpoint.     

Screening alternatives graphically by an extended case-based distance approach

Screening is a helpful process of multiple criteria decision aid (MCDA) to reduce a larger set of alternatives into a smaller one containing the best alternatives; thereby, decision makers are able to concentrate on evaluating alternatives within a smaller set. Therefore, determining how to assist decision makers in screening is an important issue for MCDA. This study proposes an extended case-based distance approach incorporating the advantages of a case-based distance method, a mixed-integer programming approach of discriminant analysis, and a multidimensional scaling technique to help decision makers screen alternatives visually in MCDA. The proposed approach can screen alternatives by evaluating sets of cases selected by decision makers, providing visual aids to observe decision context, reducing the number of misclassifications, and improving multiple solution problems. An interactive screening procedure is also developed to provide flexibility so that decision makers can check and adjust screening results iteratively.     

Methods for comparing policies using multiple criteria: an urban example

This paper looks at a variety of methods that can be used in evaluating a set of alternate policies using multiple criteria. The methods examined are the structural mapping of indifferences, utility values, lexicographic ordering, factor analysis, concordance analysis and multidimension scaling. Each method is tested using hypothetical data for a problem in which alternative policies are proposed for allocating monies to housing and health projects in a town. The aim is to try to reveal as objectively as possible, a set of preferred alternatives from which one can be chosen in the political decision-making process. After describing and testing the methods individually, they are compared both on the basis of their results and on the principles involved in their approach. Conclusions about the validity of each method are given, and it is emphasized that all methods should only be used as aids in the choice of an optimal policy.     

A Profit‐Maximizing Approach to Disposition Decisions for Product Returns*

Motivated by the asset recovery process at IBM, we analyze the optimal disposition decision for product returns in electronic products industries. Returns may be either remanufactured for reselling or dismantled for spare parts. Reselling a remanufactured unit typically yields higher unit margins. However, demand is uncertain. A common policy in many firms is to rank disposition alternatives by unit margins. We propose a profit‐maximization approach that considers demand uncertainty. We develop single period and multiperiod stochastic optimization models for the disposition problem. Analyzing these models, we show that the optimal allocation balances expected marginal profits across the disposition alternatives. A detailed numerical study reveals that our approach to the disposition problem outperforms the current practice of focusing exclusively on high‐margin options, and we identify conditions under which this improvement is the highest. In addition, we show that a simple myopic heuristic in the multiperiod problem performs well.     

Sequential Search and Selection Problem Under Uncertainty

This paper formulates and discusses a series of sequential decision problems of the following common structure: A decision alternative of multiple attributes‐that is, a job, an employee, or an investment alternative‐is to be selected within a certain fixed length of time. An unknown number of alternatives are presented sequentially, either deterministically or in a random manner. The decision maker can rank all the alternatives from best to worst without ties, and the decision to accept or reject an alternative is based solely on the relative ranks of those alternatives evaluated so far. The nonparametric sequential decision problem is first studied for a model involving a discrete time period and then generalized in terms of continuous time. Also considered is a variant of this problem involving a Bayesian estimation of (1) the uncertain probability of having an alternative at a given stage in the discrete‐time model and (2) the arrival rate of alternatives in the continuous‐time model. The optimal selection strategy that maximizes the probability of selecting the absolute best alternative is illustrated with the job search problem and the single‐machine job assignment problem.     

Best-worst multi-criteria decision-making method

In this paper, a new method, called best-worst method (BWM) is proposed to solve multi-criteria decision-making (MCDM) problems. In an MCDM problem, a number of alternatives are evaluated with respect to a number of criteria in order to select the best alternative(s). According to BWM, the best (e.g. most desirable, most important) and the worst (e.g. least desirable, least important) criteria are identified first by the decision-maker. Pairwise comparisons are then conducted between each of these two criteria (best and worst) and the other criteria. A maximin problem is then formulated and solved to determine the weights of different criteria. The weights of the alternatives with respect to different criteria are obtained using the same process. The final scores of the alternatives are derived by aggregating the weights from different sets of criteria and alternatives, based on which the best alternative is selected. A consistency ratio is proposed for the BWM to check the reliability of the comparisons. To illustrate the proposed method and evaluate its performance, we used some numerical examples and a real-word decision-making problem (mobile phone selection). For the purpose of comparison, we chose AHP (analytic hierarchy process), which is also a pairwise comparison-based method. Statistical results show that BWM performs significantly better than AHP with respect to the consistency ratio, and the other evaluation criteria: minimum violation, total deviation, and conformity. The salient features of the proposed method, compared to the existing MCDM methods, are: (1) it requires less comparison data; (2) it leads to more consistent comparisons, which means that it produces more reliable results.     

Ensemble ranking: Aggregation of rankings produced by different multi-criteria decision-making methods

One of the essential problems in multi-criteria decision-making (MCDM) is ranking a set of alternatives based on a set of criteria. In this regard, there exist several MCDM methods which rank the alternatives in different ways. As such, it would be worthwhile to try and arrive at a consensus on this important subject. In this paper, a new approach is proposed based on the half-quadratic (HQ) theory. The proposed approach determines an optimal weight for each of the MCDM ranking methods, which are used to compute the aggregated final ranking. The weight of each ranking method is obtained via a minimizer function that is inspired by the HQ theory, which automatically fulfills the basic constraints of weights in MCDM. The proposed framework also provides a consensus index and a trust level for the aggregated ranking. To illustrate the proposed approach, the evaluation and comparison of ontology alignment systems are modeled as an MCDM problem and the proposed framework is applied to the ontology alignment evaluation initiative (OAEI) 2018, for which the ranking of participating systems is of the utmost importance.     

Robust Ordinal Regression and Stochastic Multiobjective Acceptability Analysis in multiple criteria hierarchy process for the Choquet integral preference model

The paper deals with two important issues of Multiple Criteria Decision Aiding: interaction between criteria and hierarchical structure of criteria. To handle interactions, we apply the Choquet integral as a preference model, and to handle the hierarchy of criteria, we apply the recently proposed methodology called Multiple Criteria Hierarchy Process. In addition to dealing with the above issues, we suppose that the preference information provided by the Decision Maker is indirect and has the form of pairwise comparisons of criteria with respect to their importance and pairwise preference comparisons of some pairs of alternatives with respect to some criteria. In consequence, many instances of the Choquet integral are usually compatible with this preference information. These instances are identified and exploited by Robust Ordinal Regression and Stochastic Multiobjective Acceptability Analysis. To illustrate the whole approach, we show its application to a real world decision problem concerning the ranking of universities for a hypothetical Decision Maker.     

The indifference band in multiple criteria decision problems

A case study of a discrete multiobjective problem using the ‘Indifference Band’ approach is presented. An outranking relation among the various alternatives was obtained and compared with the management's own ranking. It was found that the ‘Indifference Band’ approach can be used in ranking procedures.     

EXPLORING MARKET PRICING STRATEGIES VIA DYNAMIC PROGRAMMING

Price determinants as well as strategies can be studies by use of simulation, particularly if cost and price relationships can be related to market activity [1] [9] [11]. But, through the use of dynamic programming, given the market conditions, one can extend the analysis to include an optimal strategy. This paper describes a dynamic programming approach to studying price strategy. A model is developed to show that in a market characterized by cost/volume and price/volume relationships, profitability can be extended beyond that resulting from a dominant market strategy to an optimal maximizing strategy. Extension of the model is suggested for studying (a) sensitivity of a strategy (solution) to price level and cost changes, (b) optimal timing of withdrawal, and (c) present value analysis.     

An Experimental Study of the Effectiveness of Three Debiasing Techniques*

Subjective probability distributions constitute an important part of the input to decision analysis and other decision aids. The long list of persistent biases associated with human judgments under uncertainy [16] suggests, however, that these biases can be translated into the elicited probabilities which, in turn, may be reflected in the output of the decision aids, potentially leading to biased decisions. This experiment studies the effectiveness of three debiasing techniques in elicitation of subjective probability distributions. It is hypothesized that the Socratic procedure [18] and the devil's advocate approach [6] [7] [31] [32] [33] [34] will increase subjective uncertainty and thus help assessors overcome a persistent bias called “overconfidence.” Mental encoding of the frequency of the observed instances into prespecified intervals, however, is expected to decrease subjective uncertainty and to help assessors better capture, mentally, the location and skewness of the observed distribution. The assessors' ratings of uncertainty confirm these hypotheses related to subjective uncertainty but three other measures based on the dispersion of the elicited subjective probability distributions do not. Possible explanations are discussed. An intriguing explanation is that debiasing may affect what some have called “second order” uncertainty. While uncertainty ratings may include this second component, the measures based on the elicited distributions relate only to “first order” uncertainty.     

基于区间灰色不确定语言的多准则决策方法

定义了区间灰色不确定语言及其运算法则和距离公式。拓展了连续区间数据的OWA(C-OWA)算子,提出了基于区间灰色不确定语言的有序加权C-OWA(IGULOWC-OWA)算子,并对其性质进行了分析。针对准则权重已知而方案的准则值为区间灰色不确定语言的多准则决策问题,提出了一种基于IGULOWC-OWA算子的多准则决策方法。该方法通过对各方案在各个准则下的评价值进行转换,将区间灰色不确定语言转化为不确定语言,然后,利用集结算子计算出各个方案的综合准则值,进而得出各方案的排序。最后通过算例表明了方法的可行性和有效性。     

Data and Model Management in a Generalized MCDM-DSS*

Drawing upon the choice models developed in the multiple criteria decision making (MCDM) area, this paper proposes an architecture for designing an intelligent decision support system (DSS) that is intended to aid in making choices among multiple alternatives along multiple dimensions. It argues that effective support can be provided to the decision maker when the knowledge-based DSS is capable of dynamically selecting choice models appropriate to the domain and context of a particular problem being specified by the decision maker, and of properly applying them to the problem solution. Development of a prototype intended to partially represent application of the architecture is described. The paper concludes with suggestions for research extensions.     

Strategy Alternatives for Homeland Air and Cruise Missile Defense

Air and cruise missile defense of the U.S. homeland is characterized by a requirement to protect a large number of critical assets nonuniformly dispersed over a vast area with relatively few defensive systems. In this article, we explore strategy alternatives to make the best use of existing defense resources and suggest this approach as a means of reducing risk while mitigating the cost of developing and acquiring new systems. We frame the issue as an attacker‐defender problem with simultaneous moves. First, we outline and examine the relatively simple problem of defending comparatively few locations with two surveillance systems. Second, we present our analysis and findings for a more realistic scenario that includes a representative list of U.S. critical assets. Third, we investigate sensitivity to defensive strategic choices in the more realistic scenario. As part of this investigation, we describe two complementary computational methods that, under certain circumstances, allow one to reduce large computational problems to a more manageable size. Finally, we demonstrate that strategic choices can be an important supplement to material solutions and can, in some cases, be a more cost‐effective alternative.     

ON FINDING AN INITIAL SOLUTION FOR THE DUAL SIMPLEX ALGORITHM

Torrance [4] has proposed a “new” approach to finding an initial solution of a linear programming problem for use in conjunction with the dual simplex algorithm. The purpose of this note is to comment on two aspects of that paper. Firstly, Torrance's method is not new at all, but was proposed in 1958 by Wagner. Secondly, the method can be implemented much more efficiently than Torrance suggests.