竞争与合作统一框架下的鲁棒最优再保险策略

在实际中,多个保险人之间经常存在竞争与合作.文章在竞争与合作统一框架下,研究了鲁棒最优再保险策略.每个保险人的盈余过程满足扩散逼近保险模型,n个保险人的索赔之间存在相依关系,每个保险人通过再保险减少索赔风险.文章主要的研究目标是,在最坏市场环境下,寻找最优均衡再保险策略最大化终端财富的均值同时最小化其方差.通过使用随机动态规划和随机控制理论,求得了鲁棒最优均衡再保险策略、最优市场策略和最优值函数的显式解,并从理论上探讨了最优策略的经济意义.最终,通过数值实验分析了竞争、合作、模糊厌恶和风险厌恶对鲁棒最优均衡再保险策略的影响.文章的研究结果可以有效地指导保险人的实践.     

相依风险模型下具有延迟和违约风险的鲁棒最优投资和再保险策略（英文）

本文研究了在风险相依模型下具有延迟和违约风险的鲁棒最优投资再保险策略.假设模糊厌恶型保险人的财富过程有两类相依的保险业务并且余额可以投资于无风险资产、可违约债券和价格过程遵循Heston模型的风险资产.利用动态规划原则,我们分别建立了违约后和违约前的鲁棒HJB方程.另外,通过最大化终端财富的期望指数效用,我们得到了最优投资和再保险策略以及相应的值函数.最后,通过一些数值例子说明了某些模型参数对鲁棒最优策略的影响.     

基于演化博弈理论的知识服务网络复制动态模型

在知识服务网络中,知识供应方和知识需求方在传递知识的过程中进行着重复博弈,并根据收益矩阵选择有利策略逐渐模仿,最终采用某个策略达到了演化稳定均衡状态.首先,根据演化博弈理论,建立了知识服务网络的复制动态演化博弈模型.然后,采用多智能体建模仿真方法及Netlogo仿真平台对所建模型进行仿真分析.最后,通过仿真分析得到在不同的初始情况下,知识主体最终的演化稳定策略与各主体中采取合作策略的初始比例和鞍点的大小关系有关,验证了所建立模型的正确性.     

考虑风险偏好的动态生产库存问题的鲁棒优化模型

不同阶段需求不确定情况下,决策者的风险偏好和生产过程中的废品处理影响着供应链生产库存管理和供应链整体效益。本文考虑决策者风险偏好下,构建了包含I个生产者企业,一个库存点和一个废物处理基地的T阶段动态供应链生产库存框架,建立了椭球型需求不确定集下,以追求整体收益最大化为目标的不确定优化模型,并应用鲁棒优化理论得到了数据确定性线性鲁棒对应模型,讨论了模型解的可靠性和有效性。最后的算例表明,只有当决策者风险偏好参数在一定范围内时,才会存在满足条件且具有较高可靠性的鲁棒决策,验证了该鲁棒优化模型的合理性。     

产出不确定下易逝品限量预售鲁棒策略分析

限量预售是融合供需对接而成的复合型销售模式,正受到企业上市易逝品的青睐.在产出不确定环境下,基于易逝品随机产出因子部分信息,构建生产商在正常销售前引入限量预售的两阶段鲁棒报童模型,在鲁棒决策下探讨了预售策略.研究表明:限量预售既能纾解产出不确定风险导致的供需矛盾,又能减小该风险对期望利润带来的冲击;限量预售模式选择的阈值条件由易逝品随机产出因子变异系数,两阶段销售价格及需求影响因子共同权衡确定.同时,发现鲁棒最优预售量及其影响因素并提供了策略建议.     

网络化马尔可夫跳变系统的鲁棒无源控制

针对基于网络的凸多面体不确定离散时间马尔可夫跳变系统,研究其鲁棒无源控制问题.在网络诱导时滞是时变且有界的情况下,基于李雅普诺夫稳定性理论,通过构造参数依赖的随机李雅普诺夫泛函和运用广义系统变换,提出了不依赖模态的无源控制器存在的时滞依赖充分条件.所设计的鲁棒无源控制器保证了相应的闭环系统是鲁棒随机稳定且具有指定耗散率.将鲁棒无源控制器设计问题转化为一组线性矩阵不等式的可解性问题.仿真算例证明了本文方法的有效性.     

一类含任意大不确定参数的非线性多智能体的协同输出调节问题

相对阶大于1的非线性多智能体的全局鲁棒协同输出调节问题需要用递归方法构造出分布式控制器.当系统的不确定参数和外加输入可以任意大时,单凭鲁棒控制技术不足以解决问题.本文尝试结合鲁棒与自适应动态高增益等控制技术来解决相对阶为2的输出反馈型非线性多智能体系统在不确定参数和外加输入可以任意大时的全局鲁棒协同输出调节问题.本文的理论结果已应用于求解超混沌(hyper-chaotic)Lorenz多智能体系统的一致性分布控制问题.     

一种不确定需求下库存定价模型的鲁棒优化方法

本文研究了不确定需求下一种多阶段定价与库存控制相协调的供应链模型,把扰动参数的不确定性处理为在已知集合内变化扰动. 针对不确定参数取值的几种集合情况下,应用鲁棒优化技术将不确定库存一定价模型转化为可求解的鲁棒模型. 最后进行了数值实验,对结果进行了分析.     

两类零售企业竞争策略选择的演化博弈分析

运用演化博弈理论分析了在同一市场两类零售企业行为的演化过程.根据两类企业竞争策略的复制者动态方程,分析了两类企业策略选择的演化均衡特征,并分析了一些主要参数对企业竞争策略选择的影响.结果表明,企业的相对实力和两企业竞争成本的乘积对企业行为的演化起着至关重要的作用.     

不同价格水平下排队策略研究

在M/M/1排队中引入了不同的服务价格,基于"收益-成本"结构,以顾客和企业均追求利益最大化为出发点,在两种不可见情形下,研究了顾客均衡策略行为和企业最优服务定价决策,通过数值模拟,描述了休假期服务价格对顾客均衡策略的影响,以及几乎不可见情况下休假期服务价格对企业收益的作用和完全不可见情况下休假期服务价格随潜在到达率的变化情况,以及当企业获得最大收益时,正常工作期和休假期服务价格的关系.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².