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.展开更多
In a first for the African continent,Senegal will host the Dakar 2026 Youth Olympic Games(YOG)from 31 October to 13 November.The Dakar 2026 YOG carry a strong symbolic ambition,embodied by their motto“Africa welcomes...In a first for the African continent,Senegal will host the Dakar 2026 Youth Olympic Games(YOG)from 31 October to 13 November.The Dakar 2026 YOG carry a strong symbolic ambition,embodied by their motto“Africa welcomes,Dakar celebrates.”Host Senegal sees the event as a catalyst for its influence,the modernisation of its infrastructure,and the mobilisation of its youth.展开更多
GameQualityAssurance(QA)currently relies heavily onmanual testing,a process that is both costly and time-consuming.Traditional script-and log-based automation tools are limited in their ability to detect unpredictable...GameQualityAssurance(QA)currently relies heavily onmanual testing,a process that is both costly and time-consuming.Traditional script-and log-based automation tools are limited in their ability to detect unpredictable visual bugs,especially those that are context-dependent or graphical in nature.As a result,many issues go unnoticed during manual QA,which reduces overall game quality,degrades the user experience,and creates inefficiencies throughout the development cycle.This study proposes two approaches to address these challenges.The first leverages a Large Language Model(LLM)to directly analyze gameplay videos,detect visual bugs,and automatically generate QA reports in natural language.The second approach introduces a pipeline method:first generating textual descriptions of visual bugs in game videos using the ClipCap model,then using those descriptions as input for the LLM to synthesize QA reports.Through these two multi-faceted approaches,this study evaluates the feasibility of automated game QA systems.To implement this system,we constructed a visual bug database derived from real-world game cases and fine-tuned the ClipCap model for the game video domain.Our proposed approach aims to enhance both efficiency and quality in game development by reducing the burden of manual QA while improving the accuracy of visual bug detection and ensuring consistent,reliable report generation.展开更多
The problem of maneuvering for a servicing spacecraft(inspector)to inspect a noncooperative spacecraft(evader)in cislunar space is investigated in this paper.The evader,which may be a malfunctioning or uncontrolled sa...The problem of maneuvering for a servicing spacecraft(inspector)to inspect a noncooperative spacecraft(evader)in cislunar space is investigated in this paper.The evader,which may be a malfunctioning or uncontrolled satellite,introduces uncertainties due to its potential maneuvering capabilities.To address this challenge,the scenario is modeled as a special orbital game,incorporating the unique complexities of the cislunar environment.A variable-duration,turn-based inspection and anti-inspection game model is designed.The model defines both players'rules,constraints,and victory conditions,providing a framework for non-cooperative inspection.Strategies for both players are developed and validated based on their dynamical properties.The inspector's strategy integrates two-body Lambert transfers with shooting methods,while the evader's strategy aims to maximize the inspector's fuel consumption.Simulation results show that the evader's optimal strategy involves deliberate fluctuations in its lunar periapsis altitude,with the inspector's requiredΔV up to eight times greater than the evader's.The impact of game constraints is evaluated,and the effectiveness of deploying the inspector in low lunar orbit is compared with the inspector at the Earth-Moon Lagrange point L1.The strengths and weaknesses of both are shown.These findings provide valuable insights for future orbital servicing and orbital games.展开更多
This paper suggests a way to improve teamwork and reduce uncertainties in operations by using a game theory approach involving multiple virtual power plants(VPP).A generalized credibility-based fuzzy chance constraint...This paper suggests a way to improve teamwork and reduce uncertainties in operations by using a game theory approach involving multiple virtual power plants(VPP).A generalized credibility-based fuzzy chance constraint programming approach is adopted to address uncertainties stemming from renewable generation and load demand within individual VPPs,while robust optimization techniques manage electricity and thermal price volatilities.Building upon this foundation,a hierarchical Nash-Stackelberg game model is established across multiple VPPs.Within each VPP,a Stackelberg game resolves the strategic interaction between the operator and photovoltaic prosumers(PVP).Among VPPs,a cooperative Nash bargaining model coordinates alliance formation.The problem is decomposed into two subproblems:maximizing coalitional benefits,and allocating cooperative surpluses via payment bargaining,solved distributively using the alternating direction method of multipliers(ADMM).Case studies demonstrate that the proposed strategy significantly enhances the economic efficiency and uncertainty resilience of multi-VPP alliances.展开更多
In strategic decision-making tasks,determining how to assign limited costly resource towards the defender and the attacker is a central problem.However,it is hard for pre-allocated resource assignment to adapt to dyna...In strategic decision-making tasks,determining how to assign limited costly resource towards the defender and the attacker is a central problem.However,it is hard for pre-allocated resource assignment to adapt to dynamic fighting scenarios,and exists situations where the scenario and rule of the Colonel Blotto(CB)game are too restrictive in real world.To address these issues,a support stage is added as supplementary for pre-allocated results,in which a novel two-stage competitive resource assignment problem is formulated based on CB game and stochastic Lanchester equation(SLE).Further,the force attrition in these two stages is formulated as a stochastic progress to consider the complex fighting progress,including the case that the player with fewer resources defeats the player with more resources and wins the battlefield.For solving this two-stage resource assignment problem,nested solving and no-regret learning are proposed to search the optimal resource assignment strategies.Numerical experiments are taken to analyze the effectiveness of the proposed model and study the assignment strategies in various cases.展开更多
Social engineering attacks are considered one of the most hazardous cyberattacks in cybersecurity,as human vulnerabilities are often the weakest link in the entire network.Such vulnerabilities are becoming increasingl...Social engineering attacks are considered one of the most hazardous cyberattacks in cybersecurity,as human vulnerabilities are often the weakest link in the entire network.Such vulnerabilities are becoming increasingly susceptible to network security risks.Addressing the social engineering attack defense problem has been the focus of many studies.However,two main challenges hinder its successful resolution.Firstly,the vulnerabilities in social engineering attacks are unique due to multistage attacks,leading to incorrect social engineering defense strategies.Secondly,social engineering attacks are real-time,and the defense strategy algorithms based on gaming or reinforcement learning are too complex to make rapid decisions.This paper proposes a multiattribute quantitative incentive method based on human vulnerability and an improved Q-learning(IQL)reinforcement learning method on human vulnerability attributes.The proposed algorithm aims to address the two main challenges in social engineering attack defense by using a multiattribute incentive method based on human vulnerability to determine the optimal defense strategy.Furthermore,the IQL reinforcement learning method facilitates rapid decision-making during real-time attacks.The experimental results demonstrate that the proposed algorithm outperforms the traditional Qlearning(QL)and deep Q-network(DQN)approaches in terms of time efficiency,taking 9.1%and 19.4%less time,respectively.Moreover,the proposed algorithm effectively addresses the non-uniformity of vulnerabilities in social engineering attacks and provides a reliable defense strategy based on human vulnerability attributes.This study contributes to advancing social engineering attack defense by introducing an effective and efficient method for addressing the vulnerabilities of human factors in the cybersecurity domain.展开更多
When the maneuverability of a pursuer is not significantly higher than that of an evader,it will be difficult to intercept the evader with only one pursuer.Therefore,this article adopts a two-to-one differential game ...When the maneuverability of a pursuer is not significantly higher than that of an evader,it will be difficult to intercept the evader with only one pursuer.Therefore,this article adopts a two-to-one differential game strategy,the game of kind is generally considered to be angle-optimized,which allows unlimited turns,but these practices do not take into account the effect of acceleration,which does not correspond to the actual situation,thus,based on the angle-optimized,the acceleration optimization and the acceleration upper bound constraint are added into the game for consideration.A two-to-one differential game problem is proposed in the three-dimensional space,and an improved multi-objective grey wolf optimization(IMOGWO)algorithm is proposed to solve the optimal game point of this problem.With the equations that describe the relative motions between the pursuers and the evader in the three-dimensional space,a multi-objective function with constraints is given as the performance index to design an optimal strategy for the differential game.Then the optimal game point is solved by using the IMOGWO algorithm.It is proved based on Markov chains that with the IMOGWO,the Pareto solution set is the solution of the differential game.Finally,it is verified through simulations that the pursuers can capture the escapee,and via comparative experiments,it is shown that the IMOGWO algorithm performs well in terms of running time and memory usage.展开更多
In this paper,we investigate analytical numerical iterative strategies for the pursuit-evasion game involving spacecraft with leader–follower information.In the proposed problem,the interplay between two spacecraft g...In this paper,we investigate analytical numerical iterative strategies for the pursuit-evasion game involving spacecraft with leader–follower information.In the proposed problem,the interplay between two spacecraft gives rise to a dynamic and real-time game,complicated further by the presence of perturbation.The primary challenge lies in crafting control strategies that are both efficient and applicable to real-time game problems within a nonlinear system.To overcome this challenge,we introduce the model prediction and iterative correction technique proposed in model predictive static programming,enabling the generation of strategies in analytical iterative form for nonlinear systems.Subsequently,we proceed by integrating this model predictive framework into a simplified Stackelberg equilibrium formulation,tailored to address the practical complexities of leader–follower pursuit-evasion scenarios.Simulation results validate the effectiveness and exceptional efficiency of the proposed solution within a receding horizon framework.展开更多
This paper proposes a novel impulsive thrust strategy guided by optimal continuous thrust strategy to address two-player orbital pursuit-evasion game under impulsive thrust control.The strategy seeks to enhance the in...This paper proposes a novel impulsive thrust strategy guided by optimal continuous thrust strategy to address two-player orbital pursuit-evasion game under impulsive thrust control.The strategy seeks to enhance the interpretability of impulsive thrust strategy by integrating it within the framework of differential game in traditional continuous systems.First,this paper introduces an impulse-like constraint,with periodical changes in thrust amplitude,to characterize the impulsive thrust control.Then,the game with the impulse-like constraint is converted into the two-point boundary value problem,which is solved by the combined shooting and deep learning method proposed in this paper.Deep learning and numerical optimization are employed to obtain the guesses for unknown terminal adjoint variables and the game terminal time.Subsequently,the accurate values are solved by the shooting method to yield the optimal continuous thrust strategy with the impulse-like constraint.Finally,the shooting method is iteratively employed at each impulse decision moment to derive the impulsive thrust strategy guided by the optimal continuous thrust strategy.Numerical examples demonstrate the convergence of the combined shooting and deep learning method,even if the strongly nonlinear impulse-like constraint is introduced.The effect of the impulsive thrust strategy guided by the optimal continuous thrust strategy is also discussed.展开更多
Dear Editor,This letter addresses the impulse game problem for a general scope of deterministic,multi-player,nonzero-sum differential games wherein all participants adopt impulse controls.Our objective is to formulate...Dear Editor,This letter addresses the impulse game problem for a general scope of deterministic,multi-player,nonzero-sum differential games wherein all participants adopt impulse controls.Our objective is to formulate this impulse game problem with the modified objective function including interaction costs among the players in a discontinuous fashion,and subsequently,to derive a verification theorem for identifying the feedback Nash equilibrium strategy.展开更多
In this paper,we investigate the distributed Nash equilibrium(NE)seeking problem for aggregative games with multiple uncertain Euler–Lagrange(EL)systems over jointly connected and weight-balanced switching networks.T...In this paper,we investigate the distributed Nash equilibrium(NE)seeking problem for aggregative games with multiple uncertain Euler–Lagrange(EL)systems over jointly connected and weight-balanced switching networks.The designed distributed controller consists of two parts:a dynamic average consensus part that asymptotically reproduces the unknown NE,and an adaptive reference-tracking module responsible for steering EL systems’positions to track a desired trajectory.The generalized Barbalat’s Lemma is used to overcome the discontinuity of the closed-loop system caused by the switching networks.The proposed algorithm is illustrated by a sensor network deployment problem.展开更多
The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicl...The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicleto-infrastructure coordination frameworks partially address congestion mitigation,they often neglect priority-aware optimization and exhibit algorithmic bias toward dominant vehicle classes—critical limitations in mixed-priority scenarios involving emergency vehicles.To bridge this gap,this study proposes a preference game-theoretic coordination framework with adaptive strategy transfer protocol,explicitly balancing system-wide efficiency(measured by network throughput)with priority vehicle rights protection(quantified via time-sensitive utility functions).The approach innovatively combines(1)a multi-vehicle dynamic routing model with quantifiable preference weights,and(2)a distributed Nash equilibrium solver updated using replicator sub-dynamic models.The framework was evaluated on an urban road network containing 25 intersections with mixed priority ratios(10%–30%of vehicles with priority access demand),and the framework showed consistent benefits on four benchmarks(Social routing algorithm,Shortest path algorithm,The comprehensive path optimisation model,The emergency vehicle timing collaborative evolution path optimization method)showed consistent benefits.Results showthat across different traffic demand configurations,the proposed method reduces the average vehicle traveling time by at least 365 s,increases the road network throughput by 48.61%,and effectively balances the road loads.This approach successfully meets the diverse traffic demands of various vehicle types while optimizing road resource allocations.The proposed coordination paradigm advances theoretical foundations for fairness-aware traffic optimization while offering implementable strategies for next-generation cooperative vehicle-road systems,particularly in smart city deployments requiring mixed-priority mobility guarantees.展开更多
The article studies the evolutionary dynamics of two-population two-strategy game models with and without impulses. First, the payment matrix is given and two evolutionary dynamics models are established by adding sto...The article studies the evolutionary dynamics of two-population two-strategy game models with and without impulses. First, the payment matrix is given and two evolutionary dynamics models are established by adding stochastic and impulse. For the stochastic model without impulses, the existence and uniqueness of solution, and the existence of positive periodic solutions are proved, and a sufficient condition for strategy extinction is given. For the stochastic model with impulses, the existence of positive periodic solutions is proved. Numerical results show that noise and impulses directly affect the model, but the periodicity of the model does not change.展开更多
The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are ...The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are computationally expensive and scarce.We propose a novel hyper-gradient type method with a warm-start strategy to address this challenge.Particularly,we first use a Taylor expansion-based approach to obtain a good initial point.Then we apply a hyper-gradient descent method with an ex-plicit approximate hyper-gradient.We establish the convergence results of our algorithm theoretically.Furthermore,when the follower employs the least squares loss function,our method is shown to reach an e-stationary point by solving quadratic subproblems.Numerical experiments show our algorithms are empirically orders of magnitude faster than the state-of-the-art.展开更多
The two-player nonzero-sum linear-exponential-quadratic stochastic differential game is studied.The game takes into account the players'attitudes to risk.The nonlinear transformations and change of probability mea...The two-player nonzero-sum linear-exponential-quadratic stochastic differential game is studied.The game takes into account the players'attitudes to risk.The nonlinear transformations and change of probability measure techniques are used to study the existence of both open-loop and closed-loop Nash equilibria for the game.Some examples are constructed to illustrate their differences.Furthermore,theoretical results are applied to solve the risk-sensitive portfolio game problem in the financial market and show the effects of risk attitudes and economic performance on equilibria.展开更多
成果名称:Shapley's Conjecture on the Cores of Abstract Market Games主要作者:曹志刚,秦承忠,杨晓光奖项类别:著作论文奖获奖等级:二等奖获奖论文《Shapley's Conjecture on the Cores of Abstract Market Games》发表于博...成果名称:Shapley's Conjecture on the Cores of Abstract Market Games主要作者:曹志刚,秦承忠,杨晓光奖项类别:著作论文奖获奖等级:二等奖获奖论文《Shapley's Conjecture on the Cores of Abstract Market Games》发表于博弈论领域顶级期刊《Games and Economic Behavior》2018年第2期。论文研究成果初步解决了诺贝尔经济学奖获得者罗伊德·沙普利(Lloyd S. Shapley)提出的抽象市场博弈核非空的猜想。展开更多
This paper presents a comprehensive overview of distributed Nash equilibrium(NE)seeking algorithms in non-cooperative games for multiagent systems(MASs),with a distinct emphasis on the dynamic control perspective.It s...This paper presents a comprehensive overview of distributed Nash equilibrium(NE)seeking algorithms in non-cooperative games for multiagent systems(MASs),with a distinct emphasis on the dynamic control perspective.It specifically focuses on the research addressing distributed NE seeking problems in which agents are governed by heterogeneous dynamics.The paper begins by introducing fundamental concepts of general non-cooperative games and the NE,along with definitions of specific game structures such as aggregative games and multi-cluster games.It then systematically reviews existing studies on distributed NE seeking for various classes of MASs from the viewpoint of agent dynamics,including first-order,second-order,high-order,linear,and Euler-Lagrange(EL)systems.Furthermore,the paper highlights practical applications of these theoretical advances in cooperative control scenarios involving autonomous systems with complex dynamics,such as autonomous surface vessels,autonomous aerial vehicles,and other autonomous vehicles.Finally,the paper outlines several promising directions for future research.展开更多
Background Autism spectrum disorder(ASD)is a pervasive developmental disorder characterized by difficulties in social communication and restricted,repetitive behaviors.Early intervention is essential to improve develo...Background Autism spectrum disorder(ASD)is a pervasive developmental disorder characterized by difficulties in social communication and restricted,repetitive behaviors.Early intervention is essential to improve developmental outcomes in children with ASD.Serious games,which combine educational objectives with game based interactions,have shown potential as tools for early intervention in patients with ASD.However,in China,the development of serious games specifically designed for children with ASD remains in its infancy,with significant gaps in technical frameworks and effective data management methods.Method This paper proposes a framework aimed at facilitating the development of multimodal serious games designed for ASD interventions.We demonstrated the feasibility of the framework by developing and integrating several components,such as web applications,mobile games,and augmented reality games.These tools are interconnected to achieve data connectivity and management.Additionally,adaptive mechanics were employed within the framework to analyze real-time player data,which allowed the game difficulty to be dynamically adjusted and provide a personalized experience for each child.Results The framework successfully integrated various multimodal games,ensuring that real-time data management supported personalized game experiences.This approach ensured that the interventions remained appropriately challenging while still achievable.Conclusion The results indicate that the proposed framework enhances collaboration among therapists,parents,and developers while also improving the effectiveness of ASD interventions.By delivering personalized gameplay experiences that are both challenging and achievable,the framework offers a scalable platform for the future development of serious games.展开更多
基金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.
文摘In a first for the African continent,Senegal will host the Dakar 2026 Youth Olympic Games(YOG)from 31 October to 13 November.The Dakar 2026 YOG carry a strong symbolic ambition,embodied by their motto“Africa welcomes,Dakar celebrates.”Host Senegal sees the event as a catalyst for its influence,the modernisation of its infrastructure,and the mobilisation of its youth.
基金supported by a grant from the Korea Creative Content Agency,funded by the Ministry of Culture,Sports and Tourism of the Republic of Korea in 2025,for the project,“Development of AI-based large-scale automatic game verification technology to improve game production verification efficiency for small and medium-sized game companies”(RS 2024-00393500).
文摘GameQualityAssurance(QA)currently relies heavily onmanual testing,a process that is both costly and time-consuming.Traditional script-and log-based automation tools are limited in their ability to detect unpredictable visual bugs,especially those that are context-dependent or graphical in nature.As a result,many issues go unnoticed during manual QA,which reduces overall game quality,degrades the user experience,and creates inefficiencies throughout the development cycle.This study proposes two approaches to address these challenges.The first leverages a Large Language Model(LLM)to directly analyze gameplay videos,detect visual bugs,and automatically generate QA reports in natural language.The second approach introduces a pipeline method:first generating textual descriptions of visual bugs in game videos using the ClipCap model,then using those descriptions as input for the LLM to synthesize QA reports.Through these two multi-faceted approaches,this study evaluates the feasibility of automated game QA systems.To implement this system,we constructed a visual bug database derived from real-world game cases and fine-tuned the ClipCap model for the game video domain.Our proposed approach aims to enhance both efficiency and quality in game development by reducing the burden of manual QA while improving the accuracy of visual bug detection and ensuring consistent,reliable report generation.
基金supported by the National Key R&D Pro-gram of China:Gravitational Wave Detection Project(Nos.2021YFC2026,2021YFC2202601,2021YFC2202603)the National Natural Science Foundation of China(Nos.12172288 and 12472046)。
文摘The problem of maneuvering for a servicing spacecraft(inspector)to inspect a noncooperative spacecraft(evader)in cislunar space is investigated in this paper.The evader,which may be a malfunctioning or uncontrolled satellite,introduces uncertainties due to its potential maneuvering capabilities.To address this challenge,the scenario is modeled as a special orbital game,incorporating the unique complexities of the cislunar environment.A variable-duration,turn-based inspection and anti-inspection game model is designed.The model defines both players'rules,constraints,and victory conditions,providing a framework for non-cooperative inspection.Strategies for both players are developed and validated based on their dynamical properties.The inspector's strategy integrates two-body Lambert transfers with shooting methods,while the evader's strategy aims to maximize the inspector's fuel consumption.Simulation results show that the evader's optimal strategy involves deliberate fluctuations in its lunar periapsis altitude,with the inspector's requiredΔV up to eight times greater than the evader's.The impact of game constraints is evaluated,and the effectiveness of deploying the inspector in low lunar orbit is compared with the inspector at the Earth-Moon Lagrange point L1.The strengths and weaknesses of both are shown.These findings provide valuable insights for future orbital servicing and orbital games.
基金supported by Science and Technology Project of SGCC(Research on Distributed Cooperative Control of Virtual Power Plants Based on Hybrid Game)(5700-202418337A-2-1-ZX).
文摘This paper suggests a way to improve teamwork and reduce uncertainties in operations by using a game theory approach involving multiple virtual power plants(VPP).A generalized credibility-based fuzzy chance constraint programming approach is adopted to address uncertainties stemming from renewable generation and load demand within individual VPPs,while robust optimization techniques manage electricity and thermal price volatilities.Building upon this foundation,a hierarchical Nash-Stackelberg game model is established across multiple VPPs.Within each VPP,a Stackelberg game resolves the strategic interaction between the operator and photovoltaic prosumers(PVP).Among VPPs,a cooperative Nash bargaining model coordinates alliance formation.The problem is decomposed into two subproblems:maximizing coalitional benefits,and allocating cooperative surpluses via payment bargaining,solved distributively using the alternating direction method of multipliers(ADMM).Case studies demonstrate that the proposed strategy significantly enhances the economic efficiency and uncertainty resilience of multi-VPP alliances.
基金supported by the National Natural Science Foundation of China(61702528,61806212,62173336)。
文摘In strategic decision-making tasks,determining how to assign limited costly resource towards the defender and the attacker is a central problem.However,it is hard for pre-allocated resource assignment to adapt to dynamic fighting scenarios,and exists situations where the scenario and rule of the Colonel Blotto(CB)game are too restrictive in real world.To address these issues,a support stage is added as supplementary for pre-allocated results,in which a novel two-stage competitive resource assignment problem is formulated based on CB game and stochastic Lanchester equation(SLE).Further,the force attrition in these two stages is formulated as a stochastic progress to consider the complex fighting progress,including the case that the player with fewer resources defeats the player with more resources and wins the battlefield.For solving this two-stage resource assignment problem,nested solving and no-regret learning are proposed to search the optimal resource assignment strategies.Numerical experiments are taken to analyze the effectiveness of the proposed model and study the assignment strategies in various cases.
基金funded by the Beijing Natural Science Foundation (4202002).
文摘Social engineering attacks are considered one of the most hazardous cyberattacks in cybersecurity,as human vulnerabilities are often the weakest link in the entire network.Such vulnerabilities are becoming increasingly susceptible to network security risks.Addressing the social engineering attack defense problem has been the focus of many studies.However,two main challenges hinder its successful resolution.Firstly,the vulnerabilities in social engineering attacks are unique due to multistage attacks,leading to incorrect social engineering defense strategies.Secondly,social engineering attacks are real-time,and the defense strategy algorithms based on gaming or reinforcement learning are too complex to make rapid decisions.This paper proposes a multiattribute quantitative incentive method based on human vulnerability and an improved Q-learning(IQL)reinforcement learning method on human vulnerability attributes.The proposed algorithm aims to address the two main challenges in social engineering attack defense by using a multiattribute incentive method based on human vulnerability to determine the optimal defense strategy.Furthermore,the IQL reinforcement learning method facilitates rapid decision-making during real-time attacks.The experimental results demonstrate that the proposed algorithm outperforms the traditional Qlearning(QL)and deep Q-network(DQN)approaches in terms of time efficiency,taking 9.1%and 19.4%less time,respectively.Moreover,the proposed algorithm effectively addresses the non-uniformity of vulnerabilities in social engineering attacks and provides a reliable defense strategy based on human vulnerability attributes.This study contributes to advancing social engineering attack defense by introducing an effective and efficient method for addressing the vulnerabilities of human factors in the cybersecurity domain.
基金National Natural Science Foundation of China(NSFC61773142,NSFC62303136)。
文摘When the maneuverability of a pursuer is not significantly higher than that of an evader,it will be difficult to intercept the evader with only one pursuer.Therefore,this article adopts a two-to-one differential game strategy,the game of kind is generally considered to be angle-optimized,which allows unlimited turns,but these practices do not take into account the effect of acceleration,which does not correspond to the actual situation,thus,based on the angle-optimized,the acceleration optimization and the acceleration upper bound constraint are added into the game for consideration.A two-to-one differential game problem is proposed in the three-dimensional space,and an improved multi-objective grey wolf optimization(IMOGWO)algorithm is proposed to solve the optimal game point of this problem.With the equations that describe the relative motions between the pursuers and the evader in the three-dimensional space,a multi-objective function with constraints is given as the performance index to design an optimal strategy for the differential game.Then the optimal game point is solved by using the IMOGWO algorithm.It is proved based on Markov chains that with the IMOGWO,the Pareto solution set is the solution of the differential game.Finally,it is verified through simulations that the pursuers can capture the escapee,and via comparative experiments,it is shown that the IMOGWO algorithm performs well in terms of running time and memory usage.
基金supported,in part,by the National Natural Science Foundation of China(Nos.12372050 and 62088101)the Zhejiang Provincial Natural Science Foundation of China(No.LR20F030003).
文摘In this paper,we investigate analytical numerical iterative strategies for the pursuit-evasion game involving spacecraft with leader–follower information.In the proposed problem,the interplay between two spacecraft gives rise to a dynamic and real-time game,complicated further by the presence of perturbation.The primary challenge lies in crafting control strategies that are both efficient and applicable to real-time game problems within a nonlinear system.To overcome this challenge,we introduce the model prediction and iterative correction technique proposed in model predictive static programming,enabling the generation of strategies in analytical iterative form for nonlinear systems.Subsequently,we proceed by integrating this model predictive framework into a simplified Stackelberg equilibrium formulation,tailored to address the practical complexities of leader–follower pursuit-evasion scenarios.Simulation results validate the effectiveness and exceptional efficiency of the proposed solution within a receding horizon framework.
基金funded by the National Natural Science Foundation of China(No.U21B6001)。
文摘This paper proposes a novel impulsive thrust strategy guided by optimal continuous thrust strategy to address two-player orbital pursuit-evasion game under impulsive thrust control.The strategy seeks to enhance the interpretability of impulsive thrust strategy by integrating it within the framework of differential game in traditional continuous systems.First,this paper introduces an impulse-like constraint,with periodical changes in thrust amplitude,to characterize the impulsive thrust control.Then,the game with the impulse-like constraint is converted into the two-point boundary value problem,which is solved by the combined shooting and deep learning method proposed in this paper.Deep learning and numerical optimization are employed to obtain the guesses for unknown terminal adjoint variables and the game terminal time.Subsequently,the accurate values are solved by the shooting method to yield the optimal continuous thrust strategy with the impulse-like constraint.Finally,the shooting method is iteratively employed at each impulse decision moment to derive the impulsive thrust strategy guided by the optimal continuous thrust strategy.Numerical examples demonstrate the convergence of the combined shooting and deep learning method,even if the strongly nonlinear impulse-like constraint is introduced.The effect of the impulsive thrust strategy guided by the optimal continuous thrust strategy is also discussed.
基金supported in part by the National Natural Science Foundation of China(62173051)the Fundamental Research Funds for the Central Universities(2024CDJCGJ012,2023CDJXY-010)+1 种基金the Chongqing Technology Innovation and Application Development Special Key Project(CSTB2022TIADCUX0015,CSTB2022TIAD-KPX0162)the China Postdoctoral Science Foundation(2024M763865)
文摘Dear Editor,This letter addresses the impulse game problem for a general scope of deterministic,multi-player,nonzero-sum differential games wherein all participants adopt impulse controls.Our objective is to formulate this impulse game problem with the modified objective function including interaction costs among the players in a discontinuous fashion,and subsequently,to derive a verification theorem for identifying the feedback Nash equilibrium strategy.
基金supported by the Research Grants Council of the Hong Kong Special Administration Region under the Grant No.14201621。
文摘In this paper,we investigate the distributed Nash equilibrium(NE)seeking problem for aggregative games with multiple uncertain Euler–Lagrange(EL)systems over jointly connected and weight-balanced switching networks.The designed distributed controller consists of two parts:a dynamic average consensus part that asymptotically reproduces the unknown NE,and an adaptive reference-tracking module responsible for steering EL systems’positions to track a desired trajectory.The generalized Barbalat’s Lemma is used to overcome the discontinuity of the closed-loop system caused by the switching networks.The proposed algorithm is illustrated by a sensor network deployment problem.
基金funded by the National Key Research and Development Program Project 2022YFB4300404.
文摘The real-time path optimization for heterogeneous vehicle fleets in large-scale road networks presents significant challenges due to conflicting traffic demands and imbalanced resource allocation.While existing vehicleto-infrastructure coordination frameworks partially address congestion mitigation,they often neglect priority-aware optimization and exhibit algorithmic bias toward dominant vehicle classes—critical limitations in mixed-priority scenarios involving emergency vehicles.To bridge this gap,this study proposes a preference game-theoretic coordination framework with adaptive strategy transfer protocol,explicitly balancing system-wide efficiency(measured by network throughput)with priority vehicle rights protection(quantified via time-sensitive utility functions).The approach innovatively combines(1)a multi-vehicle dynamic routing model with quantifiable preference weights,and(2)a distributed Nash equilibrium solver updated using replicator sub-dynamic models.The framework was evaluated on an urban road network containing 25 intersections with mixed priority ratios(10%–30%of vehicles with priority access demand),and the framework showed consistent benefits on four benchmarks(Social routing algorithm,Shortest path algorithm,The comprehensive path optimisation model,The emergency vehicle timing collaborative evolution path optimization method)showed consistent benefits.Results showthat across different traffic demand configurations,the proposed method reduces the average vehicle traveling time by at least 365 s,increases the road network throughput by 48.61%,and effectively balances the road loads.This approach successfully meets the diverse traffic demands of various vehicle types while optimizing road resource allocations.The proposed coordination paradigm advances theoretical foundations for fairness-aware traffic optimization while offering implementable strategies for next-generation cooperative vehicle-road systems,particularly in smart city deployments requiring mixed-priority mobility guarantees.
基金Supported by the National Natural Science Foundation of China(10671182)。
文摘The article studies the evolutionary dynamics of two-population two-strategy game models with and without impulses. First, the payment matrix is given and two evolutionary dynamics models are established by adding stochastic and impulse. For the stochastic model without impulses, the existence and uniqueness of solution, and the existence of positive periodic solutions are proved, and a sufficient condition for strategy extinction is given. For the stochastic model with impulses, the existence of positive periodic solutions is proved. Numerical results show that noise and impulses directly affect the model, but the periodicity of the model does not change.
文摘The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are computationally expensive and scarce.We propose a novel hyper-gradient type method with a warm-start strategy to address this challenge.Particularly,we first use a Taylor expansion-based approach to obtain a good initial point.Then we apply a hyper-gradient descent method with an ex-plicit approximate hyper-gradient.We establish the convergence results of our algorithm theoretically.Furthermore,when the follower employs the least squares loss function,our method is shown to reach an e-stationary point by solving quadratic subproblems.Numerical experiments show our algorithms are empirically orders of magnitude faster than the state-of-the-art.
文摘The two-player nonzero-sum linear-exponential-quadratic stochastic differential game is studied.The game takes into account the players'attitudes to risk.The nonlinear transformations and change of probability measure techniques are used to study the existence of both open-loop and closed-loop Nash equilibria for the game.Some examples are constructed to illustrate their differences.Furthermore,theoretical results are applied to solve the risk-sensitive portfolio game problem in the financial market and show the effects of risk attitudes and economic performance on equilibria.
文摘成果名称:Shapley's Conjecture on the Cores of Abstract Market Games主要作者:曹志刚,秦承忠,杨晓光奖项类别:著作论文奖获奖等级:二等奖获奖论文《Shapley's Conjecture on the Cores of Abstract Market Games》发表于博弈论领域顶级期刊《Games and Economic Behavior》2018年第2期。论文研究成果初步解决了诺贝尔经济学奖获得者罗伊德·沙普利(Lloyd S. Shapley)提出的抽象市场博弈核非空的猜想。
基金National Natural Science Foundation of China(62325304).
文摘This paper presents a comprehensive overview of distributed Nash equilibrium(NE)seeking algorithms in non-cooperative games for multiagent systems(MASs),with a distinct emphasis on the dynamic control perspective.It specifically focuses on the research addressing distributed NE seeking problems in which agents are governed by heterogeneous dynamics.The paper begins by introducing fundamental concepts of general non-cooperative games and the NE,along with definitions of specific game structures such as aggregative games and multi-cluster games.It then systematically reviews existing studies on distributed NE seeking for various classes of MASs from the viewpoint of agent dynamics,including first-order,second-order,high-order,linear,and Euler-Lagrange(EL)systems.Furthermore,the paper highlights practical applications of these theoretical advances in cooperative control scenarios involving autonomous systems with complex dynamics,such as autonomous surface vessels,autonomous aerial vehicles,and other autonomous vehicles.Finally,the paper outlines several promising directions for future research.
基金Supported by the Public Welfare Technology Application Research Project of Zhejiang Province(No.LTGY23F020001)the Provincial Construction Programme for First-Class Online and Offline Blended Courses(No.Z202Y22513)the Higher Education Teaching Reform Research Programme of Communication University of Zhejiang“Research on Contextualized Teaching Mode for the New Generation of Engineering Students Based on Convergence Media”。
文摘Background Autism spectrum disorder(ASD)is a pervasive developmental disorder characterized by difficulties in social communication and restricted,repetitive behaviors.Early intervention is essential to improve developmental outcomes in children with ASD.Serious games,which combine educational objectives with game based interactions,have shown potential as tools for early intervention in patients with ASD.However,in China,the development of serious games specifically designed for children with ASD remains in its infancy,with significant gaps in technical frameworks and effective data management methods.Method This paper proposes a framework aimed at facilitating the development of multimodal serious games designed for ASD interventions.We demonstrated the feasibility of the framework by developing and integrating several components,such as web applications,mobile games,and augmented reality games.These tools are interconnected to achieve data connectivity and management.Additionally,adaptive mechanics were employed within the framework to analyze real-time player data,which allowed the game difficulty to be dynamically adjusted and provide a personalized experience for each child.Results The framework successfully integrated various multimodal games,ensuring that real-time data management supported personalized game experiences.This approach ensured that the interventions remained appropriately challenging while still achievable.Conclusion The results indicate that the proposed framework enhances collaboration among therapists,parents,and developers while also improving the effectiveness of ASD interventions.By delivering personalized gameplay experiences that are both challenging and achievable,the framework offers a scalable platform for the future development of serious games.
