网络游戏赌博性质分析

网络游戏产业快速发展的同时,赌博现象混迹其中。网络游戏赌博与传统赌博只是形式上的不同,其实质就是一种赌博行为。只有从教育、法制、监督、自律四方面综合治理,才能使这个行业健康发展。     

军用认知无线电网络中功率控制博弈算法的探讨

通过对比军用认知无线功率控制博弈模型与一些经典的功率控制博弈算法,提出了一种认知无线电网络中的功率控制的博弈算法。通过仿真结果性能分析,证明算法具有一定的优越性,并且能够为军事无线通信提供一定的理论依据和现实作用。     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

地方物流供应商“偷懒”行为监管机制研究

军民融合现代军事物流体系中,地方物流供应商往往会"偷懒",这必将损害军民融合现代军事物流体系的整体绩效。首先描述了"偷懒"行为及其危害性,从机制入手,基于博弈论建立地方物流供应商"偷懒"行为监管机制;分析并证明了监管机制的有效性。这一机制的构建对于监管地方物流供应商具有重要作用。     

Reconciling strategic studies … with itself: a common framework for choosing among strategies

Three distinct, and seemingly irreconcilable, schools of thought are identified within the strategic studies literature. One which searches for “universal principles of war,” a second, “context-dependent,” approach that seeks to embed each instance of warfare within its concurrent social, political, technological milieu and, finally a “paradoxical logic” school, which equates strategy with the generation of uncertainty. The author offers some intuitive concepts from non-cooperative game theory to develop a “dominate-mix” approach to strategy choice. In doing so, he helps to reconcile these disparate approaches and provides a simple framework to assist researchers in framing military decisions as well as to assist planners in choosing among strategies.     

Interchange fee rate,merchant discount rate,and retail price in a credit card network: A game‐theoretic analysis

We consider two game‐theoretic settings to determine the optimal values of an issuer's interchange fee rate, an acquirer's merchant discount rate, and a merchant's retail price in a credit card network. In the first setting, we investigate a two‐stage game problem in which the issuer and the acquirer first negotiate the interchange fee rate, and the acquirer and the retailer then determine their merchant discount rate and retail price, respectively. In the second setting, motivated by the recent US bill “H.R. 2695,” we develop a three‐player cooperative game in which the issuer, the acquirer, and the merchant form a grand coalition and bargain over the interchange fee rate and the merchant discount rate. Following the cooperative game, the retailer makes its retail pricing decision. We derive both the Shapley value‐ and the nucleolus‐characterized, and globally‐optimal unique rates for the grand coalition. Comparing the two game settings, we find that the participation of the merchant in the negotiation process can result in the reduction of both rates. Moreover, the stability of the grand coalition in the cooperative game setting may require that the merchant should delegate the credit card business only to the issuer and the acquirer with sufficiently low operation costs. We also show that the grand coalition is more likely to be stable and the U.S. bill “H.R. 2695” is thus more effective, if the degree of division of labor in the credit card network is higher as the merchant, acquirer, and issuer are more specialized in the retailing, acquiring, and issuing operations, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

MIMO雷达目标子空间建模与检测性能分析

针对具有分布孔径结构的MIMO雷达系统,建立了能描述空域和时域不确定性的目标子空间模型,即多维信号模型,并利用不变原理给出了这种MIMO雷达系统的最大不变检验统计量以及几种子空间检测器。对这些检测器性能的研究表明,目标子空间的维数以及各维上目标功率分布的均匀性对MIMO雷达系统的检测性能都有较大影响;与具有相同天线尺寸的相控阵雷达相比,在角闪烁目标的检测问题中,MIMO雷达系统除了具有非相参积累增益的优势以外,还具有较强的主瓣杂波抑制能力。     

一种基于博弈论的无线网状网络路由与信道分配联合优化算法

无线网络中的路由与信道分配可极大地影响网络的性能.为了解决无线网状网络中的路由与信道分配问题,提出并研究了一种称为CRAG(基于博弈论的无线网状网络路由与信道分配联合优化)的方法.CRAG采用协同博弈的方式将网络中的每个节点模型化为一个弈者,每个弈者的策略为与其相关的路由与信道分配方案,收益函数为给定流量需求矩阵下的成功传输流量.弈者通过协同博弈来优化收益函数以最大化网络的吞吐量.基于NS3的仿真结果表明,CRAG在收敛性、时延、丢包率和吞吐量方面优于其他当前的算法,从而证明了协同博弈的方法可以用于无线网状网络的路由与信道分配联合优化,并有效地改进网络性能.     

基于博弈论的C~4ISR系统监视与侦察功能模型

监视与侦察已成为现代C4ISR系统的重要组成部分,传统的监视与侦察系统效能分析方法存在模型难以建立、结果不准确等问题,很难量化其与作战效果之间的影响。在对基于Lanchester方程的C4ISR系统建模方法进行研究的基础上,提出了反映监视与侦察功能的Lanchester方程模型,并引入博弈论分析了战场上信息的不对称对交战结果的影响,克服了描述C4ISR系统的Lanchester方程没有考虑作战单元、对手和环境间的动态交互以及数学结构简单的缺点。仿真结果验证了模型的有效性。     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009