考虑决策者风险态度的三角直觉模糊双矩阵博弈均衡及应用

在现实博弈问题中,行动方案的选择不可避免的需要对预期支付值(收益值)进行估计和排序,且选择结果往往受到决策者风险态度有的影响。针对决策者具有不同风险态度的博弈环境,基于模糊值指标和模糊度指标确定的三角直觉模糊数排序关系,研究了具有风险态度的三角直觉模糊双矩阵博弈模型,并利用双线性规划方法,给出了该环境下的均衡策略确定方法,为现实博弈均衡的确定提供了有效的途径。最后通过企业营销策略选择的应用研究,对方法的现实有效性予以说明。     

支付值为三角直觉模糊数的约束矩阵对策模型及求解方法

研究支付值是三角直觉模糊数的约束矩阵对策的求解方法.基于加权均值和加权模糊度直觉模糊数的排序方法,以及经典的约束矩阵对策模型,将支付值为三角直觉模糊数的约束矩阵对策的求解转化为含参变量的线性规划.通过一个数值实例说明了方法的有效性和实用性.     

带策略约束的区间数双矩阵博弈的双线性规划求解方法

传统区间数双矩阵博弈理论研究局中人支付值为区间数的策略选择问题,但没有考虑局中人策略选择可能受到各种约束.创建一种求解局中人策略选择受约束且支付值为区间数的双矩阵博弈（简称带策略约束的区间数双矩阵博弈）的简单、有效的双线性规划求解方法.首先,将局中人的博弈支付看作支付值区间中数值的函数.通过证明这种函数具有单调性,据此利用支付值区间的上、下界,构造了一对辅助双线性规划模型,可分别用于显式地计算任意带策略约束的区间数双矩阵博弈中局中人区间数博弈支付的上、下界及其相应的最优策略.最后,利用考虑策略约束条件下企业和政府针对发展低碳经济策略问题的算例,通过比较其与不考虑策略约束情形下的结果,说明了提出的模型和方法的有效性、优越性及可应用性.     

带策略约束的区间数双矩阵博弈的双线性规划求解方法

传统区间数双矩阵博弈理论研究局中人支付值为区间数的策略选择问题,但没有考虑局中人策略选择可能受到各种约束.创建一种求解局中人策略选择受约束且支付值为区间数的双矩阵博弈(简称带策略约束的区间数双矩阵博弈)的简单、有效的双线性规划求解方法.首先,将局中人的博弈支付看作支付值区间中数值的函数.通过证明这种函数具有单调性,据此利用支付值区间的上、下界,构造了一对辅助双线性规划模型,可分别用于显式地计算任意带策略约束的区间数双矩阵博弈中局中人区间数博弈支付的上、下界及其相应的最优策略.最后,利用考虑策略约束条件下企业和政府针对发展低碳经济策略问题的算例,通过比较其与不考虑策略约束情形下的结果,说明了提出的模型和方法的有效性、优越性及可应用性.     

直觉模糊支付合作对策的核仁解

本文主要研究支付值为直觉模糊集的合作对策问题及其模糊核仁解.首先定义了直觉模糊集的得分函数和精确函数,并给出其排序方法,得到基于直觉模糊集的合作对策模型和适合这种模型的相应定义,同时提出了直觉模糊核仁解的概念;其次运用新的排序方法将求核仁解的问题转化为求解双目标非线性规划问题;最后通过实例分析验证了该方法的可行性和有效性。     

支付值为直觉模糊集的矩阵对策的线性规划求解方法

研究支付值为直觉模糊集的矩阵对策的求解方法.提出了支付值为直觉模糊集的矩阵对策的定义,并根据多目标优化的帕雷托最优解的概念定义了直觉模糊矩阵对策解的概念.进一步根据解的定义,证明了求此对策问题的解转化为求线性规划问题的最优解.通过一个数值实例说明了该方法的有效性和实用性.     

异类值多目标二人零和约束矩阵对策及求解方法

矩阵对策是对策理论的一个重要分支。本文根据多目标决策和模糊对策理论,研究了支付值是异类值情况下的多目标二人零和约束矩阵对策问题。文章基于不同的排序方法将直觉模糊值、三角直觉模糊数和区间直觉模糊数的多目标对策清晰化,然后根据理想点法求解多目标规划问题。通过一个数值实例说明了该方法的有效性和实用性。     

梯形直觉模糊数排序方法及在多属性决策中应用

基于梯形直觉模糊数的值和模糊度两个特征,一类梯形直觉模糊数的排序方法被研究.首先,给出了梯形直觉模糊数的定义、运算法则和截集.其次,定义了梯形直觉模糊数关于隶属度和非隶属度的值和模糊度,以及值的指标和模糊度的指标.最后,给出了梯形直觉模糊数的排序方法,并将其应用到属性值为梯形直觉模糊数的多属性决策问题中.     

直觉模糊多目标二人零和矩阵对策

研究矩阵对策是深入研究对策理论的一个基本途径和重要手段。根据直觉模糊多目标决策和模糊对策理论,研究了支付值为直觉模糊值的多目标二人零和矩阵对策。首先介绍了基于直觉模糊集的多目标二人零和矩阵对策模型,接着提出了求解直觉模糊多目标二人零和矩阵对策的线性规划方法。最后以数例说明本文提出的方法。结果表明该方法能方便地得到对策的均衡策略和均衡解。     

基于区间与模糊Shapley值的合作收益分配策略

将经典Shapley值三条公理进行拓广,提出具有模糊支付合作对策的Shapley值公理体系。研究一种特殊的模糊支付合作对策,即具有区间支付的合作对策,并且给出了该区间Shapley值形式。根据模糊数和区间数的对应关系,提出模糊支付合作对策的Shapley值,指出该模糊Shapley值是区间支付模糊合作对策的自然模糊延拓。结果表明:对于任意给定置信水平α,若α=1,则模糊Shapley值对应经典合作对策的Shapley值,否则对应具有区间支付合作对策的区间Shapley值。通过模糊数的排序,给出了最优的分配策略。由于对具有模糊支付的合作对策进行比较系统的研究,从而为如何求解局中人参与联盟程度模糊化、支付函数模糊化的合作对策,奠定了一定的基础。     

Qualitative Analysis of Bifurcating Solutions in the Lengyel-Epstein Model

One of the most fundamental problems in theoretical biology is to explain the mechanisms by which patterns and forms are created in the＇living world. In his seminal paper ＂The Chemical Basis of Morphogenesis＂, Turing showed that a system of coupled reaction-diffusion equations can be used to describe patterns and forms in biological systems. However, the first experimental evidence to the Turing patterns was observed by De Kepper and her associates（1990） on the CIMA reaction in an open unstirred reactor, almost 40 years after Turing＇s prediction. Lengyel and Epstein characterized this famous experiment using a system of reaction-diffusion equations. The Lengyel-Epstein model is in the form as follows     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

(0,1 ;0)-INTERPOLATION ON INFINITE INTERVAL (-∞, +∞)

In this paper, we study the explicit representation and convergence of (0, 1; 0)-interpolation on infinite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values are prescribed at two set of points namely the zeros of Hn(x) and H′n(x) and the first derivatives at the zeros of H′n(x).     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

Journal of the Operations Research Society of China Special issue on Operations Research in Healthcare Management

正Guest Editors:Hong Chen,Shanghai Jiao Tong University,Shanghai,China Guohua Wan,Shanghai Jiao Tong University,Shanghai,China David Yao,Columbia University,New York,USA Scope:Healthcare delivery worldwide has been fraught with high cost,low efficiency and poor quality of patient care service.For the field of operations research(OR),healthcare offers some of the biggest challenges as well as best opportunities in     

ANALYSIS IN THEORY AND APPLICATIONS Vol. 30, 2014 CONTENTS

正~~     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

An alternative mathematical algorithm for the photo- and videokeratoscope

Due to the resolution of current laser technology, the accuracy of corneal topography as measured by the videokeratoscope is no longer adequate to provide precise enough data for refractive surgery or for the fitting of customized contact lenses. We present an algorithm for recovering corneal topography that makes use of modern differential geometric techniques and numerical descent in Sobolev spaces. We believe this algorithm may be used with the photo- and videokeratoscope to increase the accuracy of the recovered corneal topography.