Construction of living cellular automata using the Physarum plasmodium

The plasmodium of Physarum polycephalum is a unicellular and multinuclear giant amoeba that has an amorphous cell body. To clearly observe how the plasmodium makes decisions in its motile and exploratory behaviours, we developed a new experimental system to pseudo-discretize the motility of the organism. In our experimental space that has agar surfaces arranged in a two-dimensional lattice, the continuous and omnidirectional movement of the plasmodium was limited to the stepwise one, and the direction of the locomotion was also limited to four neighbours. In such an experimental system, a cellular automata-like system was constructed using the living cell. We further analysed the exploratory behaviours of the plasmodium by duplicating the experimental results in the simulation models of cellular automata. As a result, it was revealed that the behaviours of the plasmodium are not reproduced by only local state transition rules; and for the reproduction, a kind of historical rule setting is needed.     

多社区网络上的命名博弈

为了模仿人类对新物体认知和命名的过程,提出了一种新型的命名博弈模型,它通过词汇的权重表示个体的认知程度,低权重词汇被删除模拟个体有限记忆的过程.实验发现,在单社区网络上,所有个体的词汇最终能够统一,通过总词汇数、不同词汇数和平均协议成功率的分析解释了新个体命名的演化过程.衰减因子和删除阈值的取值对于演化速度影响较大,当它们之间存在线性关系时演化收敛较快.通过将该模型应用到多社区网络模型上,发现收敛词汇数可能不唯一,会与社区数相同,且收敛词汇数的稳定性与网络社区化强度和社区内节点的平均度有关,而与社区内节点数无关.最后,使用微分动力学的方法对这种情况进行了定量分析.     

基于VCG机制的动态频谱分配算法

针对在Underlay频谱共享方式下的认知无线网络动态频谱分配问题,在满足主用户服务质量（QoS）的前提下,建立一种非合作博弈模型,并设计其效用函数。在借鉴VCG机制的基础上,设计相应的收益函数,提出一种可以最大化认知无线网络系统吞吐量且保证公平性的分布式动态频谱分配算法。仿真结果表明,该算法收敛速度快、公平性强。     

一种博弈竞争选择的异构无线网络最优接入策略

为了提高异构无线网络的信息传输速率和网络利用率,减少网络的系统开销,提出一种博弈竞争选择的异构无线网络最优接入策略算法,该算法在考虑了实际带宽的情况下引入了代价因子,并得到最大化的网络信息传输速率.在接入网络的选择上,通过采用基于博弈模型和最优接入策略的博弈模型,通过多项服务质量指标来计算综合竞争值,从而通过竞争值大小来选择最优的接入网络.实验仿真及数据结果表明,相比另外两种异构接入网络的选择算法,该算法具有带宽资源利用率和网络信息传输速率更高的优势.     

非合作条件下基于责任延伸制的电子废弃物回收主体利益博弈研究

针对由两个制造商、两个回收商、当地政府和消费者构成的物流系统,研究了非合作条件下电子废弃物回收主体的利益博弈.在责任延伸制前提下,以回收商为斯坦伯格主导者,分别构建了非合作条件下的垄断回收模型和竞争回收模型,并采用逆推法求解了模型的纳什均衡条件.最后进行灵敏度分析,探讨了产品替代率和回收率对两种模式下产品销售价格和回收费用的影响.结果表明,对于回收商,垄断回收模式下的平均回收费用总比竞争回收模式高,且回收商需根据临界值选择回收模式;对于制造商,垄断回收模式下设定的价格总比竞争回收模式高,且制造商总是偏好竞争回收模式.研究结果可为决策者对回收模式的选择提供理论依据.     

基于探索与利用平衡理论的灾变粒子群算法

基于算法只有适应优化问题的特性才能表现出优异性能的观点,在探索与利用平衡的理论框架下将灾变机制引入粒子群算法。在对灾变的强度和范围进行深入研究的基础上,提出4种控制灾变的方法,并通过多组正交实验研究最佳的灾变触发方式。通过实验分析得出如下结论：灾变对高维问题的作用有限;灾变强度控制在15%以下为宜;以种群多样性作为灾变的触发条件,能得到较好效果。以上述结论为基础提出自适应灾变粒子群算法,并通过与其他算法对比验证文中算法具有较好性能。     

基于效益博弈的云计算资源动态可协调分配策略研究

在对用户的任务进行计算资源分配时,为了有效提高计算资源的利用效率,减少任务执行所需要的成本,提出了一种基于效益博弈的云计算资源动态可协调分配机制。该机制采用时间矩阵和费用矩阵作为任务效益的衡量指标,提出效益博弈模型,通过该模型的效益计算方程来得到最好的资源分配策略。为了使得计算资源能够合理地按需进行分配,提出了动态可协调分配机制,在合理地分配资源,满足所有任务正常执行时所需资源的同时,最大化任务的执行效益。实验仿真及对比结果表明,在任务完成时间、任务执行的平均成本、任务完成成功率上,本文算法都取得了较好的效果。     

基于博弈理论的农田能量异构网络节点协同资源利用

针对无线传感器网络中耗能不均问题,以及可再生能源节点在农田无线传感器网络中应用的具体情况,将博弈理论引入无线传感器网络能耗问题研究中,建立了基于博弈理论的节点成簇方法,实现提高可再生能源利用率、均衡非可再生能源节点能耗的目标。方法首先建立簇收益与簇内节点收益评估模型,进行簇收益计算、簇内的两类能量异构节点个体收益的计算。在计算簇收益和节点收益的基础上进行节点成簇博弈,使得成簇方案向收益更高的策略空间进行跳转,最终达到博弈中的均衡状态。仿真实验表明,通过博弈进行无线传感器网络成簇,能够充分利用可再生能源节点能量,降低和均衡非可再生能源节点能耗,最终达到延长网络寿命的目标。     

Game‐Based Valley‐Fill Charging Coordination for Large‐Population Plug‐in Electric Vehicles

Charging coordination of large‐population autonomous plug‐in electric vehicles (PEVs) in the power grid can be formulated as a class of constrained optimization problems. To overcome the computational complexity, a game‐based method is proposed for the charging problems of the PEV population, which is composed of homogeneous subpopulations, such that individuals update their best charging strategies simultaneously with respect to a common electricity price determined by the total demand. To mitigate the oscillation behavior caused by the greedy behavior for the cheap electricity by individuals, a deviation cost is introduced to penalize against the deviation of the individual strategy from the average value of the homogeneous subpopulation. By adopting a proper deviation cost and following a best strategy update mechanism, the game systems may converge to the socially optimal valley‐fill Nash equilibrium. Simulation examples are studied to illustrate the results.     

Proportional and double imitation rules for spectrum access in cognitive radio networks

In this paper, we tackle the problem of opportunistic spectrum access in large-scale cognitive radio networks, where the unlicensed Secondary Users (SUs) access the frequency channels partially occupied by the licensed Primary Users (PUs). Each channel is characterized by an availability probability unknown to the SUs. We apply population game theory to model the spectrum access problem and develop distributed spectrum access policies based on imitation, a behavior rule widely applied in human societies consisting of imitating successful behaviors. We develop two imitation-based spectrum access policies based on the basic Proportional Imitation (PI) rule and the more advanced Double Imitation (DI) rule given that a SU can only imitate the other SUs operating on the same channel. A systematic theoretical analysis is presented for both policies on the induced imitation dynamics and the convergence properties of the proposed policies to the Nash equilibrium. Simple and natural, the proposed imitation-based spectrum access policies can be implemented distributedly based on solely local interactions and thus is especially suited in decentralized adaptive learning environments as cognitive radio networks.