Searching minimax game trees under memory space constraint

Games such as CHESS, GO and OTHELLO can be represented by minimax game trees. Among various search procedures to solve such game trees,- and SSS^* are perhaps most well known. Although it is proved that SSS^* explores only a subset of the nodes explored by-, - is commonly believed to be faster in real applications, since it requires very little memory space and hence its storage management cost is low. Contrary to this folklore, however, this paper reports, using the OTHELLO game as an example, that SSS^* is much faster than-. It is also demonstrated that SSS^* can be modified to make the required memory space controllable to some extent, while retaining the high efficiency of the original SSS^*.This research was partially supported by the Ministry of Education, Science and Culture of Japan, under a Scientific Grant-in-Aid.     

The Peer’s Dilemma: A general framework to examine cooperation in pure peer-to-peer systems

The exploration of social dilemmas is being considered a major foundation for encountering the enforced necessities of cooperation in self-organizing environments. Such environments are characterized by self-interested parties and the absence of trusted third parties. Recent approaches apply evolutionary socio-inspired games to formally prove the existence and further prolongation of cooperation patterns within communities. For instance, the Prisoner’s Dilemma game has thus provided a rich opportunity to examine self-interested behaviors in pure peer-to-peer networks. However, assuming a total absence of coalitions, incentives and punishment mechanisms, several works argue against a durable maintenance of cooperation neither at single-shot nor repeated-scenarios. In this article, we formally and experimentally demonstrate a counterexample for the latter by applying evolutionary game theory and a particular instance of the Rock–Scissors–Paper game. Our framework proves that the cyclic dominance of certain type of nodes within a P2P system has an impact and introduces a strategic aspect to the evolution of the overall community.     

证券市场中庄家与散户间的确定性微分博弈

基于确定性微分博弈理论,建立了一种庄家与散户间的连续时间的博弈模型.首先将所有散户作为一个整体与庄家进行博弈,以博弈双方持股率的动态关系作为动态系统方程,并以此构建了一个确定性微分博弈模型; 然后运用开环纳什均衡和反馈纳什均衡分别求解出满足共态函数的常微分方程组和满足价值函数的Issacs - Bellman偏微分方程,以此得到庄家与散户博弈的开环纳什均衡策略和反馈纳什均衡策略.该结果可为金融监管部门监管证券市场和证券市场投资者买卖股票提供参考.     

Run(n=2～7)金属团簇与氧反应的DFT研究

采用密度泛函理论的广义梯度近似(DFT／GGA)，对Run簇(n=2～7)与氧相互作用的几何结构与电子结构及吸附能之间的关系进行讨论。对氧原子及氧分子在Run金属簇上的吸附研究表明：电荷主要是从Ru的5s、4d轨道向O的2p轨道迁移，并使得金属．金属之间的键减弱。比较特殊的是当氧分子在桥位吸附时，Ru与吸附的O2会发生化学反应，并且由于Ru金属轨道的电子向O2的反键πg轨道转移，导致Ru-O之间的键的生成以及O-O之间的键发生断裂。同时，作者也观察到Ru．Ru之间的化学键发生断裂，形成具有原子活性的自由Ru原子，这可以部分解释一旦氧化物种形成，经过一诱导期后，氧化反应会加速进行的实验事实。     

Internal structure of coalitions in competitive and altruistic graphical coalitional games

This paper introduces a certain graphical coalitional game where the internal topology of the coalition depends on a prescribed communication graph structure among the agents. The game Value Function is required to satisfy four Axioms of Value. These axioms make it possible to provide a refined study of coalition structures on graphs by defining a formal graphical game and by assigning a Positional Advantage, based on the Shapley value, to each agent in a coalition based on its connectivity properties within the graph. Using the Axioms of Value the graphical coalitional game can be shown to satisfy properties such as convexity, fairness, cohesiveness, and full cooperativeness. Three measures of the contributions of agents to a coalition are introduced: marginal contribution, competitive contribution, and altruistic contribution. The mathematical framework given here is used to establish results regarding the dependence of these three types of contributions on the graph topology, and changes in these contributions due to changes in graph topology. Based on these different contributions, three online sequential decision games are defined on top of the graphical coalitional game, and the stable graphs under each of these sequential decision games are studied. It is shown that the stable graphs under the objective of maximizing the marginal contribution are any connected graph. The stable graphs under the objective of maximizing the competitive contribution are the complete graph. The stable graphs under the objective of maximizing the altruistic contribution are any tree.     

双渠道供应链中服务对定价和需求的影响研究

研究了集中式决策和基于Stackelberg博弈这两种情况下的双渠道供应链的定价、服务及需求的关系。制造商和零售商提供的服务对价格、需求会产生影响,渠道商改善服务有利于本渠道价格的提高,同时会影响到另一渠道的定价,影响程度与双渠道决策模式相关。与服务对定价的影响不同,渠道商提供的服务对本渠道需求产生的影响是双向的,当服务水平在一定的范围内,改善服务可以增加本渠道市场需求,降低另一渠道需求;当服务水平过高,继续改善服务不仅不能增加需求反而减少需求,同时对另一渠道的需求产生影响,这种影响与消费者市场类型存在密切关系。当消费者市场属于价格敏感型时,服务水平存在一个帕累托区间,任一渠道商改善服务都会促进双渠道需求的增加。     

基于遗传模糊推理的RPG玩家体验综合评估方法

为更高效自动地评估游戏中玩家的主观体验,强调主观满意度在游戏评估中的作用,提出一个基于玩家主观评价方法构造角色扮演类游戏(RPG)的评估模型.通过因子分析处理问卷收集的玩家评分,降维后得到7个游戏评估因子并进行解释.使用适合于描述人类思维特点的模糊推理机制来模拟玩家的评价过程,配合遗传算法来调整模糊推理过程中的参数,有效提高了评估模型的准确性.     

基于谈判集的模糊合作博弈的收益分配方案

为了弥补核心作为博弈解可能为空集的缺陷,将经典合作博弈中的谈判集解拓展到模糊合作博弈中,提出了模糊合作博弈的模糊谈判集的概念.探讨模糊网络博弈的模糊谈判集和核心的等价性质,并对相关结论加以证明.研究表明,模糊合作博弈的模糊谈判集是经典合作博弈谈判集的自然拓展,该结果丰富了对模糊合作博弈的解的研究,也表明了模糊网络博弈核心的非空性,进而保证其最优分配方案的存在性.     

Contourlet变换与生命游戏置乱相结合的视频零水印

为了达到版权保护的目的,提出一种Contourlet变换与生命游戏置乱相结合的视频零水印,Contourlet被誉为处理二维信号的最优解,算法利用其优势对关键帧处理得到低频系数,再经过核心算法处理,最后结合生命游戏规则生成特征图像,并运用加密算法对水印进行预处理以加强安全性。实验结果表明本算法较好地折中了数字水印的不可见性和鲁棒性,并能有效地抵抗常见的几何攻击和视频攻击。