基于图模型理论有序偏好下的冲突反问题研究

在冲突谈判中,能获知对手偏好是掌握谈判主动性的重要条件。本文基于冲突分析图模型理论构建了一种获取对手偏好的方法。该方法通过深入分析冲突分析图模型中Nash、GMR和SEQ三种稳定性定义,利用反向思维,建立求解对手偏好最少约束条件的数学模型。该方法能让决策者在预知冲突结局的前提下,得到对手的全部偏好信息。以“云南曲靖陆良县铬污染”冲突事件为例,通过对该事件引发的冲突进行建模和偏好分析,在已知冲突最终结局的前提下,运用数学模型,省环保厅可以得到陆良化工企业的所有偏好序,使其在冲突谈判中做到知己知彼,同时也验证了该方法的可行性和有效性。案例分析过程可以从战略层面为谈判中的一方提供参考。     

基于GMCR的双渠道供应链价格冲突动态交互模型

在冲突分析图模型中,稳定性分析的均衡结果和决策者偏好信息之间存在一个动态反复的交互过程。为此,本文提出了基于GMCR的冲突分析动态交互理论,在偏好信息和均衡结果之间引入决策者的风险认知系统,以动态模拟冲突中决策者的风险认知、偏好信息与均衡解之间的交互关系。然后,构建了基于GMCR的双渠道供应链价格冲突动态交互模型,从冲突分析动态交互视角解释了价格战背后制造商和零售商的博弈行为,并有效预测了风险规避情况下双渠道供应链价格冲突的均衡结果,为供应链管理者提供了一套系统有效的冲突分析工具。     

基于分段策略评分的冲突主体偏好排序方法及其应用

冲突中各利益主体的偏好信息对冲突局势的演变和纠纷调解具有重要影响。现有的冲突偏好排序方法主要基于决策者对冲突局势或状态、策略权重和声明信息的主观判断和理解,缺乏科学的数据来源支撑。为准确获取冲突主体的偏好信息,本文提出了一种基于调查法的分段策略冲突偏好排序方法。首先,根据决策者类别将冲突策略集合进行分段,并通过问卷、调研等方法获取每个冲突主体对所有分段策略的重要度评分信息。在此基础上,计算决策者对各个冲突状态的综合偏好评分,进而得到状态偏好的排序结果。最后以医患纠纷为例,对比分析了传统策略权重法和分段策略评分法的偏好排序和稳定性分析结果,进一步验证了所提方法的有效性。     

偏好情景应变式冲突分析模型

针对决策者偏好信息随未来潜在发展情景变化的情况,构建了偏好情景应变式冲突分析模型。首先利用情景分析技术生成了影响冲突分析的若干潜在情景,不同潜在情景下的冲突子系统共同构成偏好情景应变式冲突系统。进而将所有潜在情景下冲突子系统稳定的交集定义为情景应变式冲突模型的全局稳定。由于全局稳定条件较为苛刻,交集可能为空集,进一步从集结不同情景下偏好信息角度定义了偏好集结型稳定。具体方法是依据策略优先权法对状态打分,接着利用决策者对不同情景的重视程度集结打分值,获得集结的偏好信息,并定义相应的稳定。最后以某大型客机立项论证阶段研制周期冲突决策为例比较了这两种稳定。     

信息不对称下的超对策冲突分析反问题研究

在信息不对称且对手为信息劣势方的冲突中,对手对决策者的偏好信息容易存在误解,而正确分析对手误解的偏好将有利于决策者在冲突谈判中占据主动优势,并为后期诱导机制的设立提供决策支持。本文基于超对策理论,从冲突分析的反向视角出发,提出了求解对手误解偏好的具体方法,利用谈判中对手显露出的均衡信息,建立了求解对手误解偏好的0-1非线性规划模型。为便于求解,将该模型转化成等效的0-1线性规划模型,并进一步采用CB cuts方法及相应的算法求取该模型的所有最优解。通过双渠道冲突案例分析,进一步验证了该方法对于求解实际冲突中误解偏好的有效性。最后,根据求得的误解偏好概述了决策者如何选择诱导策略,以实现自己利益的最大化。     

构建不确定语言型多属性决策的投影模型

研究不确定语言型多属性决策评价结果与决策者对方案的偏好信息之间存在偏差的问题.通过建立与区间型语言标度对应的术语指标矩阵,及方案综合属性值与决策者主观偏好值之间的投影模型,确定属性的权重,然后运用加权法得到方案的综合属性值,利用已有的可能度矩阵排序公式得到决策方案的排序.构建了一种基于方案综合属性质与决策者主观偏好值之间的投影模型,通过算例对该方法的实用性和有效性进行了证明.     

不同风险偏好下虚拟企业风险规划研究

针对虚拟企业风险规划问题,在分析其各种风险具有随机性的特点的基础上,运用随机规划理论,分别建立风险规划的期望值模型和机会约束规划模型来描述决策者在不同风险偏好下的决策行为。针对所建立的模型,分别设计了基于蒙特卡罗模拟的粒子群优化算法、遗传算法和蚁群算法对其进行求解。仿真分析表明期望值模型较好地描述了风险中性决策者的决策行为,机会约束规划模型随着其偏好系数取值的不同描述了不同风险偏好(风险厌恶、风险中性、风险爱好)决策者的决策行为。通过对三种算法仿真结果的比较分析,表明基于蒙特卡罗模拟的粒子群优化算法在寻优能力、稳定性和收敛速度等方面优于其余两种算法,是解决此类风险规划问题的有效手段。     

基于云模型和PageRank算法的社会网络群决策方法

近年来，随着信息、通信和技术的快速发展，决策者之间的关系也由此变得越来越紧密。在此背景下，决策者基于社会网络关系存在交互，社会网络群体决策会产生比传统群体决策更多的信息，信息不完全性、随机性以及决策者有限理性等因素都会导致群体决策结果与实际情况产生偏差。针对社会网络群体决策中决策偏好信息为定性概念的语言信息，且决策者之间存在信任度的群体决策问题，本文提出了一种基于云模型和PageRank算法的社会网络群决策方法并针对现有的云聚类算法拓展出了社会网络云聚类算法。首先，将语言信息转化为云模型；其次，基于社会网络拓扑图利用PageRank算法来计算每个决策者的权重；接着，使用社会网络云聚类算法将决策者分成几个子聚集并求出子聚集的权重；最后把云模型综合成方案云，利用随机模拟技术获取各个方案云的评分，给出方案的排序，并通过对比分析验证了该方法的有效性。     

区间二型模糊集效用函数和熵在风险决策中的应用

针对以区间二型模糊集(IT2FS)为信息环境的多属性决策(MADM)问题,引入IT2FS效用函数,并提出基于IT2FS效用函数,熵和风险因子的风险决策模型。首先基于截集思想提出两种IT2FS效用函数公式,有效提取了IT2FS全部信息,比以往的序值型公式更加科学有效。其次基于已提出的IT2FS三种不确定度量存在的问题提出三种新型不确定度量,并基于此三种不确定度量提出IT2FS熵公式弥补原有熵度量的不足。再次引入风险偏好因子反映决策者不同的风险态度,并改进风险偏好因子范围。构造基于效用函数,熵和风险偏好因子的风险决策模型。最后利用一个实例分析结果表明,该风险决策模型中决策者风险偏好对属性权重以及方案的排序存在影响,该决策思想对风险投资决策和风险管理决策均有一定的参考作用。     

基于UTA方法的关键基础设施系统的保护研究

关键基础设施系统是城市的生命线,但常因突发事件频发而具有不稳定性和脆弱性。一个好的保护方案应该综合考虑关键基础设施系统的韧性和成本等多个目标,但这些目标常常相互冲突而使决策陷入困境。本研究从多目标优化角度入手,探索用UTA方法确定保护关键基础设施系统最佳方案的可行性,UTA法通过与决策者互动获取决策者的偏好信息,并基于线性规划和价值函数原理构建了决策者偏好模型。通过C县电网系统的案例分析发现UTA方法可帮助决策者在决策过程中考虑多目标之间的冲突与权衡,从而确定最满意的决策方案。     

Monte Carlo simulation techniques for group decision making with incomplete information

In this paper we deal with group decision-making problems where several decision makers elicit their own preferences separately. The decision makers’ preferences are quantified using a decision support system, which admits incomplete information concerning the decision makers’ responses to the questions they are asked. Consequently, each decision maker proposes classes of utility functions and attribute weight intervals for the different attributes. We introduce an approach based on Monte Carlo simulation techniques for aggregating decision maker preferences that could be the starting point for a negotiation process, if necessary. The negotiation process would basically involve the decision maker tightening the imprecise component utilities and weights to output more meaningful results and achieve a consensus alternative. We focus on how attribute weights and the component utilities associated with a consequence are randomly generated in the aggregation process taking into account the decision-makers’ preferences, i.e., their respective attribute weight intervals and classes of utility functions. Finally, an application to the evaluation of intervention strategies for restoring a radionuclide contaminated lake illustrates the usefulness and flexibility of this iterative process.     

Two level hierarchical time minimizing transportation problem

A two level hierarchical balanced time minimizing transportation problem is considered in this paper. The whole set of source-destination links consists of two disjoint partitions namely Level-I links and Level-II links. Some quantity of a homogeneous product is first shipped from sources to destinations by Level-I decision maker using only Level-I links, and on its completion the Level-II decision maker transports the remaining quantity of the product in an optimal fashion using only Level-II links. Transportation is assumed to be done in parallel in both the levels. The aim is to find that feasible solution for Level-I decision maker corresponding to which the optimal feasible solution for Level-II decision maker is such that the sum of shipment times in Level-I and Level-II is the least. To obtain the global optimal feasible solution of this non-convex optimization problem, related balanced time minimizing transportation problems are defined. Based upon the optimal feasible solutions of these related problems, standard cost minimizing transportation problems are constructed whose optimal feasible solutions provide various pairs for shipment times for Level-I and Level-II decision makers. The best out of these pairs is finally selected. Being dependent upon solutions of a finite number of balanced time minimizing and cost minimizing transportation problems, the proposed algorithm is a polynomial bound algorithm. The developed algorithm has been implemented and tested on a variety of test problems and performance is found to be quite encouraging.     

Portfolio selection in the Spanish stock market by interactive multiobjective programming

This study examines new versions of two interactive methods to address multiobjective problems, the aim of which is to enable the decision maker to reach a solution within the range of those considered efficient in a portfolio selection model, in which several objectives are pursued concerning risk and return and given that these are clearly conflicting objectives, the profile of the model proposed is multicriteria. Normally the range of efficient portfolios is fairly extensive thus making the selection of a single one an onerous task. In order to facilitate this process, interactive methods are used aimed at guiding the decision maker towards the optimal solution based on his preferences. Several adaptations were carried out on the original methods in order to facilitate the interactive process, improving the quality of the obtained portfolios, and these were applied to data obtained from the Madrid Stock Market, interaction taking place with two decision makers, one of whom was more aggressive than the other in their selections made.     

Generalizing variance to allow the inclusion of decision attitude in decision making under uncertainty

The problem of decision making under uncertainty is considered. It is noted that an alternative is described in terms of an uncertainty profile. We observe that a major difficulty in the decision process is the comparison of these uncertainty profiles. We discuss the need for introducing some features of an uncertainty profile to help simplify this comparison. We note that the quantification of these simplifying features involves some subjective considerations about the decision makers preferences. We introduce the idea of the decision maker’s attitudinal character to help in the formulation of these considerations. We then investigate two important features associated with an uncertainty profile. The first, the representative value, is a generalization of expected value commonly used under probabilistic uncertainty. The second, called the measure of deviation, provides a generalization of the concept of variance. We show how these new measures allows us to consider uncertainty profiles other then just the probabilistic one. They also allow us introduce other decision maker attitudes then the one implicitly assumed with the expected value and variance.     

Conjoint measurement in multiple objective decision making: A new approach

A new methodology for estimating the objective function in a multiple objective mathematical programming model is presented. A decision maker is required to provide pairwise preferences, or rank orders, of a set of solutions to the multiple objective problem. Conjoint measurement is then applied to this preference information to estimate parameters of an assumed utility function. Simulation tests support the method as being mathematically tractable, while a laboratory study with human decision makers provides encouraging results for the practicality of the technique.     

NAUTILUS method: An interactive technique in multiobjective optimization based on the nadir point

Most interactive methods developed for solving multiobjective optimization problems sequentially generate Pareto optimal or nondominated vectors and the decision maker must always allow impairment in at least one objective function to get a new solution. The NAUTILUS method proposed is based on the assumptions that past experiences affect decision makers’ hopes and that people do not react symmetrically to gains and losses. Therefore, some decision makers may prefer to start from the worst possible objective values and to improve every objective step by step according to their preferences. In NAUTILUS, starting from the nadir point, a solution is obtained at each iteration which dominates the previous one. Although only the last solution will be Pareto optimal, the decision maker never looses sight of the Pareto optimal set, and the search is oriented so that (s)he progressively focusses on the preferred part of the Pareto optimal set. Each new solution is obtained by minimizing an achievement scalarizing function including preferences about desired improvements in objective function values. NAUTILUS is specially suitable for avoiding undesired anchoring effects, for example in negotiation support problems, or just as a means of finding an initial Pareto optimal solution for any interactive procedure. An illustrative example demonstrates how this new method iterates.