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.展开更多
Vaccination is a key strategy to curb the spread of epidemics.Heterologous vaccination,unlike homologous vaccination which acts on a single target and forms a single immune barrier,covers multiple targets for broader ...Vaccination is a key strategy to curb the spread of epidemics.Heterologous vaccination,unlike homologous vaccination which acts on a single target and forms a single immune barrier,covers multiple targets for broader protection.Yet,heterologous vaccination involves a complex decision process that conventional game-theoretic approaches,such as classical,evolutionary,and minority games cannot adequately capture.The parallel minority game(PMG)can handle bounded-rational,multi-choice decisions,but its application in vaccine research remains rare.In this study,we propose a vaccination-transmission coupled dynamic mechanism based on the parallel minority game and simulate it on a two-dimensional lattice.Using actual observational data and a mean-field mathematical model,we verify the effectiveness of this mechanism in simulating realistic vaccination behavior and transmission dynamics.We further analyze the impact of key parameters,such as vaccine efficacy differences and the proportion of individuals eligible for vaccine switching,on containment effectiveness.Our results demonstrate that heterologous vaccination surpasses homologous vaccination in containment effectiveness,particularly when vaccine efficacy varies significantly.This work provides a novel framework and empirical evidence for understanding individual decision-making and population-wide immunity formation in multi-vaccine settings.展开更多
An attack-resilient distributed Nash equilibrium(NE) seeking problem is addressed for noncooperative games of networked systems under malicious cyber-attacks,i.e.,false data injection(FDI) attacks.Different from many ...An attack-resilient distributed Nash equilibrium(NE) seeking problem is addressed for noncooperative games of networked systems under malicious cyber-attacks,i.e.,false data injection(FDI) attacks.Different from many existing distributed NE seeking works,it is practical and challenging to get resilient adaptively distributed NE seeking under unknown and unbounded FDI attacks.An attack-resilient NE seeking algorithm that is distributed(i.e.,independent of global information on the graph's algebraic connectivity,Lipschitz and monotone constants of pseudo-gradients,or number of players),is presented by means of incorporating the consensus-based gradient play with a distributed attack identifier so as to achieve simultaneous NE seeking and attack identification asymptotically.Another key characteristic is that FDI attacks are allowed to be unknown and unbounded.By exploiting nonsmooth analysis and stability theory,the global asymptotic convergence of the developed algorithm to the NE is ensured.Moreover,we extend this design to further consider the attack-resilient NE seeking of double-integrator players.Lastly,numerical simulation and practical experiment results are presented to validate the developed algorithms' effectiveness.展开更多
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.展开更多
This paper studies an indefinite mean-field game with Markov jump parameters,where all agents'diffusion terms depend on control variables and both state and control average terms(x.^((N)),u.^((N)))are considered.O...This paper studies an indefinite mean-field game with Markov jump parameters,where all agents'diffusion terms depend on control variables and both state and control average terms(x.^((N)),u.^((N)))are considered.One notable aspect is the relaxation of the assumption regarding the positivity or non-negativity of weight matrices within costs,allowing for zero or even negative values.By virtue of mean-field methods and decomposition techniques,we have derived decentralized strategies presented by Hamiltonian systems and a new type of consistency condition system.These systems consist of fully coupled regime-switching forward-backward stochastic differential equations that do not conform to the Monotonicity condition.The well-posedness of these strategies is established by employing a relaxed compensator method with an easily verifiable Condition(RC)and the decomposition technique.Furthermore,we demonstrate that the resulting decentralized strategies achieve anϵ-Nash equilibrium in the indefinite case without any assumptions on admissible control sets using novel estimates of the disturbed state and cost function.Finally,our theoretical results are applied to resolve a class of mean-variance portfolio selection problems.We provide corresponding numerical simulation results and economic explanations.展开更多
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.展开更多
文摘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.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12571549,12571592,12471463,12022113,12101573)。
文摘Vaccination is a key strategy to curb the spread of epidemics.Heterologous vaccination,unlike homologous vaccination which acts on a single target and forms a single immune barrier,covers multiple targets for broader protection.Yet,heterologous vaccination involves a complex decision process that conventional game-theoretic approaches,such as classical,evolutionary,and minority games cannot adequately capture.The parallel minority game(PMG)can handle bounded-rational,multi-choice decisions,but its application in vaccine research remains rare.In this study,we propose a vaccination-transmission coupled dynamic mechanism based on the parallel minority game and simulate it on a two-dimensional lattice.Using actual observational data and a mean-field mathematical model,we verify the effectiveness of this mechanism in simulating realistic vaccination behavior and transmission dynamics.We further analyze the impact of key parameters,such as vaccine efficacy differences and the proportion of individuals eligible for vaccine switching,on containment effectiveness.Our results demonstrate that heterologous vaccination surpasses homologous vaccination in containment effectiveness,particularly when vaccine efficacy varies significantly.This work provides a novel framework and empirical evidence for understanding individual decision-making and population-wide immunity formation in multi-vaccine settings.
基金supported in part by the National Natural Science Foundation of China(62373022,U2241217,62141604)Beijing Natural Science Foundation(4252043,JQ23019)+4 种基金the Fundamental Research Funds for the Central Universities(JKF-2025037448805,JKF-2025086098295)the Aeronautical Science Fund(2023Z034051001)the Academic Excellence Foundation of BUAA for Ph.D. Studentsthe Science and Technology Innovation2030—Key Project of New Generation Artificial Intelligence(2020AAA0108200)the National Key Research and Development Program of China(2022YFB3305600)。
文摘An attack-resilient distributed Nash equilibrium(NE) seeking problem is addressed for noncooperative games of networked systems under malicious cyber-attacks,i.e.,false data injection(FDI) attacks.Different from many existing distributed NE seeking works,it is practical and challenging to get resilient adaptively distributed NE seeking under unknown and unbounded FDI attacks.An attack-resilient NE seeking algorithm that is distributed(i.e.,independent of global information on the graph's algebraic connectivity,Lipschitz and monotone constants of pseudo-gradients,or number of players),is presented by means of incorporating the consensus-based gradient play with a distributed attack identifier so as to achieve simultaneous NE seeking and attack identification asymptotically.Another key characteristic is that FDI attacks are allowed to be unknown and unbounded.By exploiting nonsmooth analysis and stability theory,the global asymptotic convergence of the developed algorithm to the NE is ensured.Moreover,we extend this design to further consider the attack-resilient NE seeking of double-integrator players.Lastly,numerical simulation and practical experiment results are presented to validate the developed algorithms' effectiveness.
基金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.
基金supported by the National Key Research and Development Program of China(2023YFA1009200)the National Natural Science Foundation of China(12401583,12571482,12521001)+2 种基金the Taishan Scholars Climbing Program of Shandong(TSPD20210302)the Basic Research Program of Jiangsu(BK20240416)the General Program of Philosophy and Social Science Research(PSSR)of Shandong Higher Education Institutions(2024ZSMS007)。
文摘This paper studies an indefinite mean-field game with Markov jump parameters,where all agents'diffusion terms depend on control variables and both state and control average terms(x.^((N)),u.^((N)))are considered.One notable aspect is the relaxation of the assumption regarding the positivity or non-negativity of weight matrices within costs,allowing for zero or even negative values.By virtue of mean-field methods and decomposition techniques,we have derived decentralized strategies presented by Hamiltonian systems and a new type of consistency condition system.These systems consist of fully coupled regime-switching forward-backward stochastic differential equations that do not conform to the Monotonicity condition.The well-posedness of these strategies is established by employing a relaxed compensator method with an easily verifiable Condition(RC)and the decomposition technique.Furthermore,we demonstrate that the resulting decentralized strategies achieve anϵ-Nash equilibrium in the indefinite case without any assumptions on admissible control sets using novel estimates of the disturbed state and cost function.Finally,our theoretical results are applied to resolve a class of mean-variance portfolio selection problems.We provide corresponding numerical simulation results and economic explanations.
基金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.
