Spacecraft require a large-angle manoeuvre when performing agile manoeuvring tasks, therefore a control moment gyroscope(CMG) is employed to provide a strong moment.However, the control of the CMG system easily falls ...Spacecraft require a large-angle manoeuvre when performing agile manoeuvring tasks, therefore a control moment gyroscope(CMG) is employed to provide a strong moment.However, the control of the CMG system easily falls into singularity, which renders the actuator unable to output the required moment. To solve the singularity problem of CMGs, the control law design of a CMG system based on a cooperative game is proposed. First, the cooperative game model is constructed according to the quadratic programming problem, and the cooperative strategy is constructed. When the strategy falls into singularity, the weighting coefficient is introduced to carry out the strategy game to achieve the optimal strategy. In theory, it is proven that the cooperative game manipulation law of the CMG system converges, the sum of the CMG frame angular velocities is minimized, the energy consumption is small, and there is no output torque error. Then, the CMG group system is simulated.When the CMG system is near the singular point, it can quickly escape the singularity. When the CMG system falls into the singularity, it can also escape the singularity. Considering the optimization of angular momentum and energy consumption, the feasibility of the CMG system steering law based on a cooperative game is proven.展开更多
The introduction of automated driving systems raised questions about how the human driver interacts with the automated system. Non-cooperative game theory is increasingly used for modelling and understanding such inte...The introduction of automated driving systems raised questions about how the human driver interacts with the automated system. Non-cooperative game theory is increasingly used for modelling and understanding such interaction, while its counterpart, cooperative game theory is rarely discussed for similar applications despite it may be potentially more suitable. This paper describes the modelling of a human driver’s steering interaction with an automated steering system using cooperative game theory. The distributed Model Predictive Control approach is adopted to derive the driver’s and the automated steering system’s strategies in a Pareto equilibrium sense, namely their cooperative Pareto steering strategies. Two separate numerical studies are carried out to study the influence of strategy parameters, and the influence of strategy types on the driver’s and the automated system’s steering performance. It is found that when a driver interacts with an automated steering system using a cooperative Pareto steering strategy, the driver can improve his/her performance in following a target path through increasing his/her effort in pursuing his/her own interest under the driver-automation cooperative control goal. It is also found that a driver’s adoption of cooperative Pareto steering strategy leads to a reinforcement in the driver’s steering angle control, compared to the driver’s adoption of non-cooperative Nash strategy. This in turn enables the vehicle to return from a lane-change maneuver to straight-line driving swifter.展开更多
Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform o...Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization,user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.展开更多
A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and con...A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and considers that each user has different average SNR and different decision threshold,by using General Nash Bargaining Solution (GNBS) strategy in Cooperative Game Theory (CGT),the detection performance for two-user case are derived. For multi-user case,the sensing performance is obtained with Hungarian method. Compared with the traditional schemes such as Nash Bargaining Solution (NBS) and AND,the proposed scheme covers all the factors mentioned above,and enhances the sensing rationality and reliability. Simulation results show that the proposed scheme can further improve the sensing performance and creditability.展开更多
Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal c...Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.展开更多
In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non...In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non-cooperative game theory,the pure Byzantine attack strategy and defense strategy in cooperative spectrum sensing are analyzed from the perspective of the Byzantine attacker and network administrator.The cost and benefit of the pure strategy on both sides are defined. Secondly,the mixed attack and defense strategy are also derived. The closed form Nash equilibrium is obtained by the Lemke-Howson algorithm. Furthermore,the impact of the benefit ratio and penalty rate on the dynamic process of the noncooperative game is analyzed. Numerical simulation results show that the proposed game-theory approach can effectively defend against the Byzantine attack and save the defensive cost.展开更多
This paper tries to integrate game theory, a very useful tool to resolve conflict phenomena, with optimal capital cost allocation issue in total emission control. First the necessity of allocating optimal capital cos...This paper tries to integrate game theory, a very useful tool to resolve conflict phenomena, with optimal capital cost allocation issue in total emission control. First the necessity of allocating optimal capital costs fairly and reasonably among polluters in total emission control was analyzed. Then the possibility of applying game theory to the issue of the optimal capital cost allocation was expounded. Next the cooperative N person game model of the optimal capital cost allocation and its solution ways including method based on Shapley value, least core method, weak least core methods, proportional least core method, CGA method, MCRS method and so on were delineated. Finally through application of these methods it was concluded that to apply game theory in the optimal capital cost allocation issue is helpful to implement the total emission control planning schemes successfully, to control pollution effectively, and to ensure sustainable development.展开更多
Internet of Things (IoT) refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we pre...Internet of Things (IoT) refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we present a tradeoff between bandwidth and energy con- sumption in the loT in this paper. A service providing model is built to find the relation- ship between bandwidth and energy consump- tion using a cooperative differential game mo- del. The game solution is gotten in the condi- tion of grand coalition, feedback Nash equili- brium and intermediate coalitions and an allo- cation policy is obtain by Shapley theory. The results are shown as follows. Firstly, the per- formance of IoT decreases with the increasing of bandwidth cost or with the decreasing of en- ergy cost; secondly, all the nodes in the IoT com- posing a grand coalition can save bandwidth and energy consumption; thirdly, when the fac- tors of bandwidth cost and energy cost are eq- ual, the obtained number of provided services is an optimised value which is the trade-off between energy and bandwidth consumption.展开更多
Wireless cooperative communications require appropriate power allocation (PA) between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information...Wireless cooperative communications require appropriate power allocation (PA) between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate (SER) at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution (NBS) to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.展开更多
In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for...In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.展开更多
Understanding the behavior of companies in market conditions has been an important topic of studies for the economists and mathematicians. Many companies have treated their relationship of service providers as a game....Understanding the behavior of companies in market conditions has been an important topic of studies for the economists and mathematicians. Many companies have treated their relationship of service providers as a game. Thus, the attitudes of the players can be endowed with rational thinking, which leads to the conclusion that the use of game theory as a tool to understand such behavior is of great importance. Based on the previous studies, this paper presents a study on the cooperative game theory, discussing the Nash equilibrium in pure and mixed strategies, treating solutions using the minimax John Von Neumarm theorem and illustrating a mathematical modeling of a game theory problem. Furthermore, a solution of linear programming using Microsoft Excel is also proposed and presented. The methodology adopted to model the problem may help students to familiarize themselves to game theory.展开更多
This paper introduced the application of game theory in electricity power market. Moreover, the electricity pool model and the merit order dispatch method was introduced. In pool mode, participants are trying to maxim...This paper introduced the application of game theory in electricity power market. Moreover, the electricity pool model and the merit order dispatch method was introduced. In pool mode, participants are trying to maximize their benefit via competition with each other. Hence the market can be regarded as a non-cooperative game, especially, the electrical supply competition. Players (generators) could use strategic bidding to occupy advantages in competition. The bidding strategies of generators in electricity pool model were researched via build a 3-generator competition model. Moreover, Nash Equilibrium idea was used to explore generator’s optimal bidding strategy. The results show when players are in Nash Equilibrium;thestrategy is their optimal bidding strategy.展开更多
针对航天器与非合作目标追逃博弈的生存型微分对策拦截问题,基于强化学习研究了追逃博弈策略,提出了自适应增强随机搜索(adaptive-augmented random search,A-ARS)算法。针对序贯决策的稀疏奖励难题,设计了基于策略参数空间扰动的探索方...针对航天器与非合作目标追逃博弈的生存型微分对策拦截问题,基于强化学习研究了追逃博弈策略,提出了自适应增强随机搜索(adaptive-augmented random search,A-ARS)算法。针对序贯决策的稀疏奖励难题,设计了基于策略参数空间扰动的探索方法,加快策略收敛速度;针对可能过早陷入局部最优问题设计了新颖度函数并引导策略更新,可提升数据利用效率;通过数值仿真验证并与增强随机搜索(augmented random search,ARS)、近端策略优化算法(proximal policy optimization,PPO)以及深度确定性策略梯度下降算法(deep deterministic policy gradient,DDPG)进行对比,验证了此方法的有效性和先进性。展开更多
基金supported by the National Natural Science Foundation of China (61973153)。
文摘Spacecraft require a large-angle manoeuvre when performing agile manoeuvring tasks, therefore a control moment gyroscope(CMG) is employed to provide a strong moment.However, the control of the CMG system easily falls into singularity, which renders the actuator unable to output the required moment. To solve the singularity problem of CMGs, the control law design of a CMG system based on a cooperative game is proposed. First, the cooperative game model is constructed according to the quadratic programming problem, and the cooperative strategy is constructed. When the strategy falls into singularity, the weighting coefficient is introduced to carry out the strategy game to achieve the optimal strategy. In theory, it is proven that the cooperative game manipulation law of the CMG system converges, the sum of the CMG frame angular velocities is minimized, the energy consumption is small, and there is no output torque error. Then, the CMG group system is simulated.When the CMG system is near the singular point, it can quickly escape the singularity. When the CMG system falls into the singularity, it can also escape the singularity. Considering the optimization of angular momentum and energy consumption, the feasibility of the CMG system steering law based on a cooperative game is proven.
文摘The introduction of automated driving systems raised questions about how the human driver interacts with the automated system. Non-cooperative game theory is increasingly used for modelling and understanding such interaction, while its counterpart, cooperative game theory is rarely discussed for similar applications despite it may be potentially more suitable. This paper describes the modelling of a human driver’s steering interaction with an automated steering system using cooperative game theory. The distributed Model Predictive Control approach is adopted to derive the driver’s and the automated steering system’s strategies in a Pareto equilibrium sense, namely their cooperative Pareto steering strategies. Two separate numerical studies are carried out to study the influence of strategy parameters, and the influence of strategy types on the driver’s and the automated system’s steering performance. It is found that when a driver interacts with an automated steering system using a cooperative Pareto steering strategy, the driver can improve his/her performance in following a target path through increasing his/her effort in pursuing his/her own interest under the driver-automation cooperative control goal. It is also found that a driver’s adoption of cooperative Pareto steering strategy leads to a reinforcement in the driver’s steering angle control, compared to the driver’s adoption of non-cooperative Nash strategy. This in turn enables the vehicle to return from a lane-change maneuver to straight-line driving swifter.
基金supported by the National High-Tech R&D Program,China(2015AA042101)
文摘Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization,user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.
基金Supported by the National High Technology Research and Development Program of China (863 Program,No.2009AA01-Z241)the National Natural Science Foundation of China (No.60772062)
文摘A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and considers that each user has different average SNR and different decision threshold,by using General Nash Bargaining Solution (GNBS) strategy in Cooperative Game Theory (CGT),the detection performance for two-user case are derived. For multi-user case,the sensing performance is obtained with Hungarian method. Compared with the traditional schemes such as Nash Bargaining Solution (NBS) and AND,the proposed scheme covers all the factors mentioned above,and enhances the sensing rationality and reliability. Simulation results show that the proposed scheme can further improve the sensing performance and creditability.
文摘Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.
基金The National Natural Science Foundation of China(No.61771126)
文摘In order to solve the Byzantine attack problem in cooperative spectrum sensing,a non-cooperative game-theory approach is proposed to realize an effective Byzantine defense.First,under the framework of the proposed non-cooperative game theory,the pure Byzantine attack strategy and defense strategy in cooperative spectrum sensing are analyzed from the perspective of the Byzantine attacker and network administrator.The cost and benefit of the pure strategy on both sides are defined. Secondly,the mixed attack and defense strategy are also derived. The closed form Nash equilibrium is obtained by the Lemke-Howson algorithm. Furthermore,the impact of the benefit ratio and penalty rate on the dynamic process of the noncooperative game is analyzed. Numerical simulation results show that the proposed game-theory approach can effectively defend against the Byzantine attack and save the defensive cost.
文摘This paper tries to integrate game theory, a very useful tool to resolve conflict phenomena, with optimal capital cost allocation issue in total emission control. First the necessity of allocating optimal capital costs fairly and reasonably among polluters in total emission control was analyzed. Then the possibility of applying game theory to the issue of the optimal capital cost allocation was expounded. Next the cooperative N person game model of the optimal capital cost allocation and its solution ways including method based on Shapley value, least core method, weak least core methods, proportional least core method, CGA method, MCRS method and so on were delineated. Finally through application of these methods it was concluded that to apply game theory in the optimal capital cost allocation issue is helpful to implement the total emission control planning schemes successfully, to control pollution effectively, and to ensure sustainable development.
基金ACKNOWLEDGEMENT We gratefully acknowledge anonymous revie- wers who read drafts and made many helpful suggestions. This work was supported by the National Natural Science Foundation of China under Grant No. 61202079 the China Post- doctoral Science Foundation under Grant No. 2013M530526+2 种基金 the Foundation of Beijing En- gineering the Fundamental Research Funds for the Central Universities under Grant No. FRF-TP-13-015A and the Technology Centre for Convergence Networks and Ubiquitous Services.
文摘Internet of Things (IoT) refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we present a tradeoff between bandwidth and energy con- sumption in the loT in this paper. A service providing model is built to find the relation- ship between bandwidth and energy consump- tion using a cooperative differential game mo- del. The game solution is gotten in the condi- tion of grand coalition, feedback Nash equili- brium and intermediate coalitions and an allo- cation policy is obtain by Shapley theory. The results are shown as follows. Firstly, the per- formance of IoT decreases with the increasing of bandwidth cost or with the decreasing of en- ergy cost; secondly, all the nodes in the IoT com- posing a grand coalition can save bandwidth and energy consumption; thirdly, when the fac- tors of bandwidth cost and energy cost are eq- ual, the obtained number of provided services is an optimised value which is the trade-off between energy and bandwidth consumption.
基金supported by National Natural Science Foundation of China (No. 60972059)Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD)+3 种基金Fundamental Research Funds for the Central Universities of China (Nos. 2010QNA27 and 2011QNB26)China Postdoctoral Science Foundation (No. 20100481185)the Ph. D. Programs Foundation of Ministry of Education of China (Nos. 20090095120013 and 20110095120006)Talent Introduction Program, and Young Teacher Sailing Program of China University of Mining and Technology
文摘Wireless cooperative communications require appropriate power allocation (PA) between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate (SER) at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution (NBS) to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.
基金supported in part by the State Major Science and Technology Special Projects under Grant No. 2012ZX03004001the National Basic Research Program (973) of China under Grants No. 2012CB315801, No. 2011CB302901the Chinese Universities Scientific Fund under Grant No. 2012RC0306
文摘In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.
文摘Understanding the behavior of companies in market conditions has been an important topic of studies for the economists and mathematicians. Many companies have treated their relationship of service providers as a game. Thus, the attitudes of the players can be endowed with rational thinking, which leads to the conclusion that the use of game theory as a tool to understand such behavior is of great importance. Based on the previous studies, this paper presents a study on the cooperative game theory, discussing the Nash equilibrium in pure and mixed strategies, treating solutions using the minimax John Von Neumarm theorem and illustrating a mathematical modeling of a game theory problem. Furthermore, a solution of linear programming using Microsoft Excel is also proposed and presented. The methodology adopted to model the problem may help students to familiarize themselves to game theory.
文摘This paper introduced the application of game theory in electricity power market. Moreover, the electricity pool model and the merit order dispatch method was introduced. In pool mode, participants are trying to maximize their benefit via competition with each other. Hence the market can be regarded as a non-cooperative game, especially, the electrical supply competition. Players (generators) could use strategic bidding to occupy advantages in competition. The bidding strategies of generators in electricity pool model were researched via build a 3-generator competition model. Moreover, Nash Equilibrium idea was used to explore generator’s optimal bidding strategy. The results show when players are in Nash Equilibrium;thestrategy is their optimal bidding strategy.
文摘针对航天器与非合作目标追逃博弈的生存型微分对策拦截问题,基于强化学习研究了追逃博弈策略,提出了自适应增强随机搜索(adaptive-augmented random search,A-ARS)算法。针对序贯决策的稀疏奖励难题,设计了基于策略参数空间扰动的探索方法,加快策略收敛速度;针对可能过早陷入局部最优问题设计了新颖度函数并引导策略更新,可提升数据利用效率;通过数值仿真验证并与增强随机搜索(augmented random search,ARS)、近端策略优化算法(proximal policy optimization,PPO)以及深度确定性策略梯度下降算法(deep deterministic policy gradient,DDPG)进行对比,验证了此方法的有效性和先进性。