This paper investigates impulsive orbital attack-defense(AD)games under multiple constraints and victory conditions,involving three spacecraft:attacker,target,and defender.In the AD scenario,the attacker aims to breac...This paper investigates impulsive orbital attack-defense(AD)games under multiple constraints and victory conditions,involving three spacecraft:attacker,target,and defender.In the AD scenario,the attacker aims to breach the defender's interception to rendezvous with the target,while the defender seeks to protect the target by blocking or actively pursuing the attacker.Four different maneuvering constraints and five potential game outcomes are incorporated to more accurately model AD game problems and increase complexity,thereby reducing the effectiveness of traditional methods such as differential games and game-tree searches.To address these challenges,this study proposes a multiagent deep reinforcement learning solution with variable reward functions.Two attack strategies,Direct attack(DA)and Bypass attack(BA),are developed for the attacker,each focusing on different mission priorities.Similarly,two defense strategies,Direct interdiction(DI)and Collinear interdiction(CI),are designed for the defender,each optimizing specific defensive actions through tailored reward functions.Each reward function incorporates both process rewards(e.g.,distance and angle)and outcome rewards,derived from physical principles and validated via geometric analysis.Extensive simulations of four strategy confrontations demonstrate average defensive success rates of 75%for DI vs.DA,40%for DI vs.BA,80%for CI vs.DA,and 70%for CI vs.BA.Results indicate that CI outperforms DI for defenders,while BA outperforms DA for attackers.Moreover,defenders achieve their objectives more effectively under identical maneuvering capabilities.Trajectory evolution analyses further illustrate the effectiveness of the proposed variable reward function-driven strategies.These strategies and analyses offer valuable guidance for practical orbital defense scenarios and lay a foundation for future multi-agent game research.展开更多
Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision p...Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision payoff functions hinge on individual covariates and the choices of their friends.However,peer pressure would be misidentified and induce a non-negligible bias when incomplete covariates are involved in the game model.For this reason,we develop a generalized constant peer effects model based on homogeneity structure in dynamic social networks.The new model can effectively avoid bias through homogeneity pursuit and can be applied to a wider range of scenarios.To estimate peer pressure in the model,we first present two algorithms based on the initialize expand merge method and the polynomial-time twostage method to estimate homogeneity parameters.Then we apply the nested pseudo-likelihood method and obtain consistent estimators of peer pressure.Simulation evaluations show that our proposed methodology can achieve desirable and effective results in terms of the community misclassification rate and parameter estimation error.We also illustrate the advantages of our model in the empirical analysis when compared with a benchmark model.展开更多
Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networ...Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB.展开更多
To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomple...To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.展开更多
Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless se...Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.展开更多
Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform o...Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization,user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.展开更多
The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual incom...The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual income and global benefits and build the logical architecture of the multi-agent system. Besides, to verify the feasibility of the method, the cyclic neural network is optimized, the bi-directional coordination network is built as the training network for deep learning, and specific training scenes are simulated as the training background. After a certain number of training iterations, the model can learn simple strategies autonomously. Also,as the training time increases, the complexity of learning strategies rises gradually. Strategies such as obstacle avoidance, firepower distribution and collaborative cover are adopted to demonstrate the achievability of the model. The model is verified to be realizable by the examples of obstacle avoidance, fire distribution and cooperative cover. Under the same resource background, the model exhibits better convergence than other deep learning training networks, and it is not easy to fall into the local endless loop.Furthermore, the ability of the learning strategy is stronger than that of the training model based on rules, which is of great practical values.展开更多
Power efficiency and link reliability are of great impor- tance in hierarchical wireless sensor networks （HWSNs）, espe- cially at the key level, which consists of sensor nodes located only one hop away from the sink...Power efficiency and link reliability are of great impor- tance in hierarchical wireless sensor networks （HWSNs）, espe- cially at the key level, which consists of sensor nodes located only one hop away from the sink node called OHS. The power and admission control problem in HWSNs is comsidered to improve its power efficiency and link reliability. This problem is modeled as a non-cooperative game in which the active OHSs are con- sidered as players. By applying a double-pricing scheme in the definition of OHSs＇ utility function, a Nash Equilibrium solution with network properties is derived. Besides, a distributed algorithm is also proposed to show the dynamic processes to achieve Nash Equilibrium. Finally, the simulation results demonstrate the effec- tiveness of the proposed algorithm.展开更多
航路网络作为民航运输网络的运行载体,承担着保障航空器安全高效运行的重要任务。当重要航路点因雷暴扰动失效时,易连锁反应至相邻节点最终导致网络性能的显著下降。针对现有复杂网络节点重要度评估模型未有效考虑雷暴扰动的问题,面向...航路网络作为民航运输网络的运行载体,承担着保障航空器安全高效运行的重要任务。当重要航路点因雷暴扰动失效时,易连锁反应至相邻节点最终导致网络性能的显著下降。针对现有复杂网络节点重要度评估模型未有效考虑雷暴扰动的问题,面向雷暴天气场景,将雷暴扰动特性纳入航路点重要度评估体系,利用博弈论方法对评估指标进行组合赋权,基于引力模型理论改进了TOPSIS(technique for order preference by similarity to an ideal solution)综合评价方法,建立基于博弈论-改进TOPSIS法的节点重要度评估模型,进而采用K中心点算法实现航路点聚类分级。以京津冀地区航班运行为例,对雷暴天气场景下的航路网络节点重要度进行评估,结果表明:在京津冀航路网络内,南部地区的航路点更易受雷暴天气影响且分布较为密集,该航路网络包含9个重要航路点,当航路网络中的重要航路点因雷暴影响而失效时,会对航路网络性能产生显著的负面影响。提出的基于博弈论-改进TOPSIS法的节点重要度评估模型可以有效识别出雷雨季节或雷暴高发地区航路网络中的重要航路点,从而为雷暴场景下航路网络结构优化与资源配置提供有效依据。展开更多
基金supported by National Key R&D Program of China:Gravitational Wave Detection Project(Grant Nos.2021YFC22026,2021YFC2202601,2021YFC2202603)National Natural Science Foundation of China(Grant Nos.12172288 and 12472046)。
文摘This paper investigates impulsive orbital attack-defense(AD)games under multiple constraints and victory conditions,involving three spacecraft:attacker,target,and defender.In the AD scenario,the attacker aims to breach the defender's interception to rendezvous with the target,while the defender seeks to protect the target by blocking or actively pursuing the attacker.Four different maneuvering constraints and five potential game outcomes are incorporated to more accurately model AD game problems and increase complexity,thereby reducing the effectiveness of traditional methods such as differential games and game-tree searches.To address these challenges,this study proposes a multiagent deep reinforcement learning solution with variable reward functions.Two attack strategies,Direct attack(DA)and Bypass attack(BA),are developed for the attacker,each focusing on different mission priorities.Similarly,two defense strategies,Direct interdiction(DI)and Collinear interdiction(CI),are designed for the defender,each optimizing specific defensive actions through tailored reward functions.Each reward function incorporates both process rewards(e.g.,distance and angle)and outcome rewards,derived from physical principles and validated via geometric analysis.Extensive simulations of four strategy confrontations demonstrate average defensive success rates of 75%for DI vs.DA,40%for DI vs.BA,80%for CI vs.DA,and 70%for CI vs.BA.Results indicate that CI outperforms DI for defenders,while BA outperforms DA for attackers.Moreover,defenders achieve their objectives more effectively under identical maneuvering capabilities.Trajectory evolution analyses further illustrate the effectiveness of the proposed variable reward function-driven strategies.These strategies and analyses offer valuable guidance for practical orbital defense scenarios and lay a foundation for future multi-agent game research.
基金supported by the National Nature Science Foundation of China(71771201,72531009,71973001)the USTC Research Funds of the Double First-Class Initiative(FSSF-A-240202).
文摘Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision payoff functions hinge on individual covariates and the choices of their friends.However,peer pressure would be misidentified and induce a non-negligible bias when incomplete covariates are involved in the game model.For this reason,we develop a generalized constant peer effects model based on homogeneity structure in dynamic social networks.The new model can effectively avoid bias through homogeneity pursuit and can be applied to a wider range of scenarios.To estimate peer pressure in the model,we first present two algorithms based on the initialize expand merge method and the polynomial-time twostage method to estimate homogeneity parameters.Then we apply the nested pseudo-likelihood method and obtain consistent estimators of peer pressure.Simulation evaluations show that our proposed methodology can achieve desirable and effective results in terms of the community misclassification rate and parameter estimation error.We also illustrate the advantages of our model in the empirical analysis when compared with a benchmark model.
基金supported by the National Science and Technology Major Project of China(2013ZX03005007-004)the National Natural Science Foundation of China(6120101361671179)
文摘Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB.
基金supported by the National Natural Science Fundation of China (60974082 60874085)+2 种基金the Fundamental Research Funds for the Central Universities (K50510700004)the Technology Plan Projects of Guangdong Province (20110401)the Team Project of Hanshan Normal University (LT201001)
文摘To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.
文摘Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.
基金supported by the National High-Tech R&D Program,China(2015AA042101)
文摘Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization,user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.
基金supported by the National Natural Science Foundation of China(61503407,61806219,61703426,61876189,61703412)the China Postdoctoral Science Foundation(2016 M602996)。
文摘The multi-agent system is the optimal solution to complex intelligent problems. In accordance with the game theory, the concept of loyalty is introduced to analyze the relationship between agents' individual income and global benefits and build the logical architecture of the multi-agent system. Besides, to verify the feasibility of the method, the cyclic neural network is optimized, the bi-directional coordination network is built as the training network for deep learning, and specific training scenes are simulated as the training background. After a certain number of training iterations, the model can learn simple strategies autonomously. Also,as the training time increases, the complexity of learning strategies rises gradually. Strategies such as obstacle avoidance, firepower distribution and collaborative cover are adopted to demonstrate the achievability of the model. The model is verified to be realizable by the examples of obstacle avoidance, fire distribution and cooperative cover. Under the same resource background, the model exhibits better convergence than other deep learning training networks, and it is not easy to fall into the local endless loop.Furthermore, the ability of the learning strategy is stronger than that of the training model based on rules, which is of great practical values.
基金supported by the National Natural Science Foundation of China (7070102571071105)+2 种基金the Program for New Century Excellent Talents in Universities of China (NCET-08-0396)the National Science Fund for Distinguished Young Scholars of China (70925005)the Program for Changjiang Scholars and Innovative Research Team in University (IRT/028)
文摘Power efficiency and link reliability are of great impor- tance in hierarchical wireless sensor networks （HWSNs）, espe- cially at the key level, which consists of sensor nodes located only one hop away from the sink node called OHS. The power and admission control problem in HWSNs is comsidered to improve its power efficiency and link reliability. This problem is modeled as a non-cooperative game in which the active OHSs are con- sidered as players. By applying a double-pricing scheme in the definition of OHSs＇ utility function, a Nash Equilibrium solution with network properties is derived. Besides, a distributed algorithm is also proposed to show the dynamic processes to achieve Nash Equilibrium. Finally, the simulation results demonstrate the effec- tiveness of the proposed algorithm.
文摘航路网络作为民航运输网络的运行载体,承担着保障航空器安全高效运行的重要任务。当重要航路点因雷暴扰动失效时,易连锁反应至相邻节点最终导致网络性能的显著下降。针对现有复杂网络节点重要度评估模型未有效考虑雷暴扰动的问题,面向雷暴天气场景,将雷暴扰动特性纳入航路点重要度评估体系,利用博弈论方法对评估指标进行组合赋权,基于引力模型理论改进了TOPSIS(technique for order preference by similarity to an ideal solution)综合评价方法,建立基于博弈论-改进TOPSIS法的节点重要度评估模型,进而采用K中心点算法实现航路点聚类分级。以京津冀地区航班运行为例,对雷暴天气场景下的航路网络节点重要度进行评估,结果表明:在京津冀航路网络内,南部地区的航路点更易受雷暴天气影响且分布较为密集,该航路网络包含9个重要航路点,当航路网络中的重要航路点因雷暴影响而失效时,会对航路网络性能产生显著的负面影响。提出的基于博弈论-改进TOPSIS法的节点重要度评估模型可以有效识别出雷雨季节或雷暴高发地区航路网络中的重要航路点,从而为雷暴场景下航路网络结构优化与资源配置提供有效依据。
