两人多冲突环境下的双矩阵对策集结模型

针对用多个双矩阵对策来描述的两人多冲突环境,首先基于局中人所受到的约束条件,构造局中人面向多冲突环境的可行策略串集合;其次以所有局中人的可行策略串集合建立新的结局空间,构造局中人在新结局空间上的支付函数,进而建立两人多冲突环境下的对策综合集结模型;最后给出了一个军事例子,该算例说明了模型的实用性.     

Inventory control under substitutable demand: A stochastic game application

Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018     

基于模糊多目标对策的雷达反干扰策略优化

考虑到单部雷达反干扰效能评估指标多样化、模糊且存在不同权重的情况,在对策论基础上提出了一种雷达反干扰策略优化模型,并在考虑局中人偏好情况下,设计了一种模糊多目标对策最优混合策略求解算法,为找出较优化的雷达反干扰策略以及为战场决策提供参考。     

Game theoretic analysis of maximum cooperative purchasing situations

This article introduces maximum cooperative purchasing (MCP)‐situations, a new class of cooperative purchasing situations. Next, an explicit alternative mathematical characterization of the nucleolus of cooperative games is provided. The allocation of possible cost savings in MCP‐situations, in which the unit price depends on the largest order quantity within a group of players, is analyzed by defining corresponding cooperative MCP‐games. We show that a decreasing unit price is a sufficient condition for a nonempty core: there is a set of marginal vectors that belong to the core. The nucleolus of an MCP‐game can be derived in polynomial time from one of these marginal vectors. To show this result, we use the new mathematical characterization for the nucleolus for cooperative games. Using the decomposition of an MCP‐game into unanimity games, we find an explicit expression for the Shapley value. Finally, the behavior of the solution concepts is compared numerically. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 607–624, 2013     

Export controls,market structure and international coordination

We look at the different ways of aggregating the exports of dual use products to give the security perception of exporter countries and their consistency with the relevant export control regimes. Also, we analyze different models of export controls highlighting the role of the perception of security, market structure and competition between exporting firms in determining the existence of multiple equilibria and therefore, the need for coordination between countries in setting export controls.     

基于微分对策的潜艇鱼雷攻击占位问题研究

针对潜艇鱼雷攻击占位问题,建立占位方案分析和优化的微分对策模型,采用影子目标法对问题进行简化。证明了在给定规避速度大小的条件下,潜艇最佳规避策略为直线运动。于是利用定性微分对策理论,给出潜艇可占领攻击阵位条件。以占位时间最短为优化目标,建立可占位情形下的占位方案优化模型,即可占位情形下的最短时间占位方案计算模型,给出最短时间占位方案解析计算公式。     

非对称Colonel Blotto博弈模型下的多信道功率分配抗干扰

针对智能干扰条件下传输速率固定的通信系统多信道功率分配问题,建立了非对称Colonel Blotto博弈模型。在完全信息条件下,推导出了各种功率预算约束下通信方和干扰方的等效单信道最优功率分配策略,进而证明了通信方和干扰方存在唯一混合纳什均衡策略,并求得了纳什均衡收益。基于等效单信道最优功率分布,提出了一种多重扫描直接列元素交换算法,可以快速构建多信道混合功率分配矩阵,且相比于线性规划方法,可适应更多的信道数和更广的功率分布范围。通过数值仿真,验证了所提多信道混合功率分配矩阵构造算法的有效性及多信道功率分配策略的最优性。     

不同游戏方式下的暴力网络游戏对大学生攻击性的影响

目的:探讨不同游戏方式下的暴力网络游戏对不同攻击性特质大学生攻击性的影响。方法:采用攻击性特质问卷、词汇决策任务和竞争反应时任务对60名大学生进行问卷和实验研究。结果:在不同游戏方式下,被试表现出的攻击性认知和行为存在显著差异(F(2,52)=4.41,P<0.05;F(1,52)=50.06,P<0.001)。高、低攻击性特质者在游戏后的攻击性认知和行为上存在显著差异(F(1,52)=15.25,P<0.001;F(1,52)=82.35,P<0.001)。结论:不同游戏方式下的暴力网络游戏对大学生的攻击性存在不同的影响,相比竞争游戏和单人游戏,合作游戏是一种较好的游戏方式,可以在一定程度减少大学生,特别是高攻击性特质大学生的攻击性认知和行为。此外,暴力网络游戏对大学生攻击性认知和攻击性行为的影响存在一致性。     

单兵种对多兵种作战的最优火力分配

本文利用微分对策方法研究了单兵种对多兵种作战时的最优火力分配原则,指出了应首先集中力量攻击敌方交战强度最大的一类作战单位。本文还说明了多兵种对多兵种作战时类似的问题的重要性和困难所在。     

To catch an intruder: Part A—uncluttered scenario

We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017