Excess Benefit Allocation in Shared Savings Based on Non-cooperative Game Theory

Energy saving income distribution mode is of great significance to the energy industry.With the continuous application of new technologies,the problem of excess energy saving income distribution has become one of the obstacles to the appreciation of energy performance.At present,the distribution of risk and income is mainly based on the contribution of risk and income,which has some limitations.The benefit distribution of energy saving negotiation between energy saving service companies and clients can be regarded as a bargaining process where an effective range satisfying both parties can be obtained.This provides a new perspective in solving the problem of excess energy saving income distribution in energy management contract projects.

Power Control Algorithm of Cognitive Radio Based on Non-Cooperative Game Theory

This paper addresses the power con- trol problems of Cognitive Radio （CR） trader transmission power and interference tempera- ture constraints. First, we propose the interfer- ence constraint which ensures that the Quality of Service （QoS） standards for primary users is considered and a non-cooperative game power control model. Based on the proposed model, we developed a logical utility function based on the Signal-to-Interference-Noise Ratio （S/NR） and a novel algorithm network power control. that is suitable for CR Then, the existence and uniqueness of the Nash Equilibrium （NE） in our utility function are proved by the principle of game theory and the corresponding optimi- zations. Compared to traditional algorithms, the proposed one could converge to an NE in 3-5 iterative operations by setting an appropriate pricing factor. Finally, simulation results ver- ified the stability and superiority of the novel algorithm in flat-fading channel environments.

QoS awared power and admission controls based on non-cooperative game theory in wireless networks

In order to better accommodate heterogeneous quality of service (QoS) in wireless networks, an algorithm called QoS-aware power and admission controls (QAPAC) is proposed. The system is modeled as a non-cooperative game where the users adjust their transmit powers to maximize the utility, thus restraining the interferences. By using adaptive utility functions and tunable pricing parameters according to QoS levels, this algorithm can well meet different QoS requirements and improve system capacity compared with those that ignore the QoS differences.

A Data Intrusion Tolerance Model Based on an Improved Evolutionary Game Theory for the Energy Internet

Malicious attacks against data are unavoidable in the interconnected,open and shared Energy Internet(EI),Intrusion tolerant techniques are critical to the data security of EI.Existing intrusion tolerant techniques suffered from problems such as low adaptability,policy lag,and difficulty in determining the degree of tolerance.To address these issues,we propose a novel adaptive intrusion tolerance model based on game theory that enjoys two-fold ideas:(1)it constructs an improved replica of the intrusion tolerance model of the dynamic equation evolution game to induce incentive weights;and (2)it combines a tournament competition model with incentive weights to obtain optimal strategies for each stage of the game process.Extensive experiments are conducted in the IEEE 39-bus system,whose results demonstrate the feasibility of the incentive weights,confirm the proposed strategy strengthens the system’s ability to tolerate aggression,and improves the dynamic adaptability and response efficiency of the aggression-tolerant system in the case of limited resources.

Network Defense Decision-Making Based on Deep Reinforcement Learning and Dynamic Game Theory

Existing researches on cyber attackdefense analysis have typically adopted stochastic game theory to model the problem for solutions,but the assumption of complete rationality is used in modeling,ignoring the information opacity in practical attack and defense scenarios,and the model and method lack accuracy.To such problem,we investigate network defense policy methods under finite rationality constraints and propose network defense policy selection algorithm based on deep reinforcement learning.Based on graph theoretical methods,we transform the decision-making problem into a path optimization problem,and use a compression method based on service node to map the network state.On this basis,we improve the A3C algorithm and design the DefenseA3C defense policy selection algorithm with online learning capability.The experimental results show that the model and method proposed in this paper can stably converge to a better network state after training,which is faster and more stable than the original A3C algorithm.Compared with the existing typical approaches,Defense-A3C is verified its advancement.

Computation Offloading in Edge Computing for Internet of Vehicles via Game Theory

With the rapid advancement of Internet of Vehicles(IoV)technology,the demands for real-time navigation,advanced driver-assistance systems(ADAS),vehicle-to-vehicle(V2V)and vehicle-to-infrastructure(V2I)communications,and multimedia entertainment systems have made in-vehicle applications increasingly computingintensive and delay-sensitive.These applications require significant computing resources,which can overwhelm the limited computing capabilities of vehicle terminals despite advancements in computing hardware due to the complexity of tasks,energy consumption,and cost constraints.To address this issue in IoV-based edge computing,particularly in scenarios where available computing resources in vehicles are scarce,a multi-master and multi-slave double-layer game model is proposed,which is based on task offloading and pricing strategies.The establishment of Nash equilibrium of the game is proven,and a distributed artificial bee colonies algorithm is employed to achieve game equilibrium.Our proposed solution addresses these bottlenecks by leveraging a game-theoretic approach for task offloading and resource allocation in mobile edge computing(MEC)-enabled IoV environments.Simulation results demonstrate that the proposed scheme outperforms existing solutions in terms of convergence speed and system utility.Specifically,the total revenue achieved by our scheme surpasses other algorithms by at least 8.98%.

Game Theory Based Model for Predictive Analytics Using Distributed Position Function

This paper presents a game theory-based method for predicting the outcomes of negotiation and group decision-making problems. We propose an extension to the BDM model to address problems where actors’ positions are distributed over a position spectrum. We generalize the concept of position in the model to incorporate continuous positions for the actors, enabling them to have more flexibility in defining their targets. We explore different possible functions to study the role of the position function and discuss appropriate distance measures for computing the distance between the positions of actors. To validate the proposed extension, we demonstrate the trustworthiness of our model’s performance and interpretation by replicating the results based on data used in earlier studies.

Risk assessment of high-speed railway CTC system based on improved game theory and cloud model

Purpose-In order to solve the problem of inaccurate calculation of index weights,subjectivity and uncertainty of index assessment in the risk assessment process,this study aims to propose a scientific and reasonable centralized traffic control(CTC)system risk assessment method.Design/methodologylapproach-First,system-theoretic process analysis(STPA)is used to conduct risk analysis on the CTC system and constructs risk assessment indexes based on this analysis.Then,to enhance the accuracy of weight calculation,the fuzzy analytical hierarchy process(FAHP),fuzzy decision-making trial and evaluation laboratory(FDEMATEL)and entropy weight method are employed to calculate the subjective weight,relative weight and objective weight of each index.These three types of weights are combined using game theory to obtain the combined weight for each index.To reduce subjectivity and uncertainty in the assessment process,the backward cloud generator method is utilized to obtain the numerical character(NC)of the cloud model for each index.The NCs of the indexes are then weighted to derive the comprehensive cloud for risk assessment of the CTC system.This cloud model is used to obtain the CTC system's comprehensive risk assessment.The model's similarity measurement method gauges the likeness between the comprehensive risk assessment cloud and the risk standard cloud.Finally,this process yields the risk assessment results for the CTC system.Findings-The cloud model can handle the subjectivity and fuzziness in the risk assessment process well.The cloud model-based risk assessment method was applied to the CTC system risk assessment of a railway group and achieved good results.Originality/value-This study provides a cloud model-based method for risk assessment of CTC systems,which accurately calculates the weight of risk indexes and uses cloud models to reduce uncertainty and subjectivity in the assessment,achieving effective risk assessment of CTC systems.It can provide a reference and theoretical basis for risk management of the CTC system.

Game Theory Optimization via Diverse Genetic Crossover Intelligence

Game theory is explored via a maze application where combinatorial optimization occurs with the objective of traversing through a defined maze with an aim to enhance decision support and locate the optimal travel sequence while minimizing computation time. This combinatorial optimization approach is initially demonstrated by utilizing a traditional genetic algorithm (GA), followed by the incorporation of artificial intelligence utilizing embedded rules based on domain-specific knowledge. The aim of this initiative is to compare the results of the traditional and rule-based optimization approaches with results acquired through an intelligent crossover methodology. The intelligent crossover approach encompasses a two-dimensional GA encoding where a second chromosome string is introduced within the GA, offering a sophisticated means for chromosome crossover amongst selected parents. Additionally, parent selection intelligence is incorporated where the best-traversed paths or population members are retained and utilized as potential parents to mate with parents selected within a traditional GA methodology. A further enhancement regarding the utilization of saved optimal population members as potential parents is mathematically explored within this literature.

On Ethical Literary Criticism and Game Theory--An Interview with Professor Nie Zhenzhao

In 2014,Huang Kaihong,a professor at School of Foreign Languages and Cultures,Southwest University of Science and Technology,interviewed the Doctoral advisor Professor Nie Zhenzhao during the period of his academic visiting to Central China Normal University.As early as in 2005,Huang Kaihong conducted an interview with Professor Nie Zhenzhao on the topic of the general introduction of ethical literary criticism.So around 11 years later,the second interview mainly covers not only the ethical literary criticism theory,but the game theory and the relationship between them as well.Professor Nie thinks whether the game theory can be applied to literature research is still under discussion.The theory of ethical literary criticism is a kind of methodology based on science and it can get the attention of literary critics at home and abroad,which is because it fits the practical needs of literary criticism,draws the literary criticism away from only emphasizing criticism genres and the research of criticism terms,and pays attention to the true nature of the literary text in literature research.After consulting Professor Nie Zhenzhao about some related questions from the perspective of game theory.Huang Kaihong gets some significant information concerning literature research and understands the latest core terms and the concrete application method of ethical literary criticism,especially the relationship between the instructing and aesthetic functions of literature.

An evolutionary game theory-based machine learning framework for predicting mandatory lane change decision

Mandatory lane change(MLC)is likely to cause traffic oscillations,which have a negative impact on traffic efficiency and safety.There is a rapid increase in research on mandatory lane change decision(MLCD)prediction,which can be categorized into physics-based models and machine-learning models.Both types of models have their advantages and disadvantages.To obtain a more advanced MLCD prediction method,this study proposes a hybrid architecture,which combines the Evolutionary Game Theory(EGT)based model(considering data efficient and interpretable)and the Machine Learning(ML)based model(considering high prediction accuracy)to model the mandatory lane change decision of multi-style drivers(i.e.EGTML framework).Therefore,EGT is utilized to introduce physical information,which can describe the progressive cooperative interactions between drivers and predict the decision-making of multi-style drivers.The generalization of the EGTML method is further validated using four machine learning models:ANN,RF,LightGBM,and XGBoost.The superiority of EGTML is demonstrated using real-world data(i.e.,Next Generation SIMulation,NGSIM).The results of sensitivity analysis show that the EGTML model outperforms the general ML model,especially when the data is sparse.

Non-Cooperative Game of Coordinated Scheduling of Parallel Machine Production and Transportation in Shared Manufacturing

Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry,the coordinated scheduling problem of parallel machine production and transportation is investigated.The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance.A non-cooperative game model is established,considering the competition and self-interest behavior of jobs from different customers for machine resources.The job from different customers is mapped to the players in the game model,the corresponding optional processing machine and location are mapped to the strategy set,and the makespan of the job is mapped to the payoff.Then the solution of the scheduling model is transformed into the Nash equilibrium of the non-cooperative game model.A Nash equilibrium solution algorithm based on the genetic algorithm(NEGA)is designed,and the effective solution of approximate Nash equilibrium for the game model is realized.The fitness function,single-point crossover operator,and mutation operator are derived from the non-cooperative game model’s characteristics and the definition of Nash equilibrium.Rules are also designed to avoid the generation of invalid offspring chromosomes.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.Compared with other algorithms such as heuristic algorithms(FCFS,SPT,and LPT),the simulated annealing algorithm(SA),and the particle swarm optimization algorithm(PSO),experimental results show that the proposed NE-GA algorithm has obvious performance advantages.

Peer-to-Peer Energy Trading Method of Multi-Virtual Power Plants Based on Non-Cooperative Game

The current electricity market fails to consider the energy consumption characteristics of transaction subjects such as virtual power plants.Besides,the game relationship between transaction subjects needs to be further explored.This paper proposes a Peer-to-Peer energy trading method for multi-virtual power plants based on a non-cooperative game.Firstly,a coordinated control model of public buildings is incorporated into the scheduling framework of the virtual power plant,considering the energy consumption characteristics of users.Secondly,the utility functions of multiple virtual power plants are analyzed,and a non-cooperative game model is established to explore the game relationship between electricity sellers in the Peer-to-Peer transaction process.Finally,the influence of user energy consumption characteristics on the virtual power plant operation and the Peer-to-Peer transaction process is analyzed by case studies.Furthermore,the effect of different parameters on the Nash equilibrium point is explored,and the influence factors of Peer-to-Peer transactions between virtual power plants are summarized.According to the obtained results,compared with the central air conditioning set as constant temperature control strategy,the flexible control strategy proposed in this paper improves the market power of each VPP and the overall revenue of the VPPs.In addition,the upper limit of the service quotation of the market operator have a great impact on the transaction mode of VPPs.When the service quotation decreases gradually,the P2P transaction between VPPs is more likely to occur.

Coordinated Scheduling of Two-Agent Production and Transportation Based on Non-Cooperative Game

A two-agent production and transportation coordinated scheduling problem in a single-machine environment is suggested to compete for one machine from different downstream production links or various consumers.The jobs of two agents compete for the processing position on a machine,and after the pro-cessed,they compete for the transport position on a transport vehicle to be trans-ported to two agents.The two agents have different objective functions.The objective function of the first agent is the sum of the makespan and the total trans-portation time,whereas the objective function of the second agent is the sum of the total completion time and the total transportation time.Given the competition between two agents for machine resources and transportation resources,a non-cooperative game model with agents as game players is established.The job pro-cessing position and transportation position corresponding to the two agents are mapped as strategies,and the corresponding objective function is the utility func-tion.To solve the game model,an approximate Nash equilibrium solution algo-rithm based on an improved genetic algorithm(NE-IGA)is proposed.The genetic operation based on processing sequence and transportation sequence,as well as the fitness function based on Nash equilibrium definition,are designed based on the features of the two-agent production and transportation coordination scheduling problem.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.When compared to heuristic rules such as the Longest Processing Time first(LPT)and the Shortest Processing Time first(SPT),the objective function values of the two agents are reduced by 4.3%and 2.6% on average.

An Optimized Resource Scheduling Strategy for Hadoop Speculative Execution Based on Non-cooperative Game Schemes

Hadoop is a well-known parallel computing system for distributed computing and large-scale data processes.“Straggling”tasks,however,have a serious impact on task allocation and scheduling in a Hadoop system.Speculative Execution(SE)is an efficient method of processing“Straggling”Tasks by monitoring real-time running status of tasks and then selectively backing up“Stragglers”in another node to increase the chance to complete the entire mission early.Present speculative execution strategies meet challenges on misjudgement of“Straggling”tasks and improper selection of backup nodes,which leads to inefficient implementation of speculative executive processes.This paper has proposed an Optimized Resource Scheduling strategy for Speculative Execution(ORSE)by introducing non-cooperative game schemes.The ORSE transforms the resource scheduling of backup tasks into a multi-party non-cooperative game problem,where the tasks are regarded as game participants,whilst total task execution time of the entire cluster as the utility function.In that case,the most benefit strategy can be implemented in each computing node when the game reaches a Nash equilibrium point,i.e.,the final resource scheduling scheme to be obtained.The strategy has been implemented in Hadoop-2.x.Experimental results depict that the ORSE can maintain the efficiency of speculative executive processes and improve fault-tolerant and computation performance under the circumstances of Normal Load,Busy Load and Busy Load with Skewed Data.

Hybrid data-driven framework for shale gas production performance analysis via game theory, machine learning, and optimization approaches

A comprehensive and precise analysis of shale gas production performance is crucial for evaluating resource potential,designing a field development plan,and making investment decisions.However,quantitative analysis can be challenging because production performance is dominated by the complex interaction among a series of geological and engineering factors.In fact,each factor can be viewed as a player who makes cooperative contributions to the production payoff within the constraints of physical laws and models.Inspired by the idea,we propose a hybrid data-driven analysis framework in this study,where the contributions of dominant factors are quantitatively evaluated,the productions are precisely forecasted,and the development optimization suggestions are comprehensively generated.More specifically,game theory and machine learning models are coupled to determine the dominating geological and engineering factors.The Shapley value with definite physical meaning is employed to quantitatively measure the effects of individual factors.A multi-model-fused stacked model is trained for production forecast,which provides the basis for derivative-free optimization algorithms to optimize the development plan.The complete workflow is validated with actual production data collected from the Fuling shale gas field,Sichuan Basin,China.The validation results show that the proposed procedure can draw rigorous conclusions with quantified evidence and thereby provide specific and reliable suggestions for development plan optimization.Comparing with traditional and experience-based approaches,the hybrid data-driven procedure is advanced in terms of both efficiency and accuracy.

A game-theoretic approach for federated learning:A trade-off among privacy,accuracy and energy

Benefiting from the development of Federated Learning(FL)and distributed communication systems,large-scale intelligent applications become possible.Distributed devices not only provide adequate training data,but also cause privacy leakage and energy consumption.How to optimize the energy consumption in distributed communication systems,while ensuring the privacy of users and model accuracy,has become an urgent challenge.In this paper,we define the FL as a 3-layer architecture including users,agents and server.In order to find a balance among model training accuracy,privacy-preserving effect,and energy consumption,we design the training process of FL as game models.We use an extensive game tree to analyze the key elements that influence the players’decisions in the single game,and then find the incentive mechanism that meet the social norms through the repeated game.The experimental results show that the Nash equilibrium we obtained satisfies the laws of reality,and the proposed incentive mechanism can also promote users to submit high-quality data in FL.Following the multiple rounds of play,the incentive mechanism can help all players find the optimal strategies for energy,privacy,and accuracy of FL in distributed communication systems.

Fuzzy Nash equilibrium of fuzzy n-person non-cooperative game

The fuzzy non-cooperative game with fuzzy payoff function is studied. Based on fuzzy set theory with game theory, the fuzzy Nash equilibrium of fuzzy non-cooperative games is proposed. Most of researchers rank fuzzy number by its center of gravity or by the real number with its maximal membership. By reducing fuzzy number into a real number, we lose much fuzzy information that should be kept during the operations between fuzzy numbers. The fuzzy quantities or alternatives are ordered directly by Yuan＇s binary fuzzy ordering relation. In doing so, the existence of fuzzy Nash equilibrium for fuzzy non-cooperative games is shown based on the utility function and the crisp Nash theorem. Finally, an illustrative example in traffic flow patterns of equilibrium is given in order to show the detailed calculation process of fuzzy Nash equilibrium.

A label noise filtering and label missing supplement framework based on game theory

Labeled data is widely used in various classification tasks.However,there is a huge challenge that labels are often added artificially.Wrong labels added by malicious users will affect the training effect of the model.The unreliability of labeled data has hindered the research.In order to solve the above problems,we propose a framework of Label Noise Filtering and Missing Label Supplement(LNFS).And we take location labels in Location-Based Social Networks(LBSN)as an example to implement our framework.For the problem of label noise filtering,we first use FastText to transform the restaurant's labels into vectors,and then based on the assumption that the label most similar to all other labels in the location is most representative.We use cosine similarity to judge and select the most representative label.For the problem of label missing,we use simple common word similarity to judge the similarity of users'comments,and then use the label of the similar restaurant to supplement the missing labels.To optimize the performance of the model,we introduce game theory into our model to simulate the game between the malicious users and the model to improve the reliability of the model.Finally,a case study is given to illustrate the effectiveness and reliability of LNFS.

Efficient Power Control for UAV Based on Trajectory and Game Theory

Due to the fact that network space is becoming more limited,the implementation of ultra-dense networks(UDNs)has the potential to enhance not only network coverage but also network throughput.Unmanned Aerial Vehicle(UAV)communications have recently garnered a lot of attention due to the fact that they are extremely versatile and may be applied to a wide variety of contexts and purposes.A cognitive UAV is proposed as a solution for the Internet of Things ground terminal’s wireless nodes in this article.In the IoT system,the UAV is utilised not only to determine how the resources should be distributed but also to provide power to the wireless nodes.The quality of service(QoS)offered by the cognitive node was interpreted as a price-based utility function,which was demonstrated in the form of a non-cooperative game theory in order to maximise customers’net utility functions.An energyefficient non-cooperative game theory power allocation with pricing strategy abbreviated as(EE-NGPAP)is implemented in this study with two trajectories Spiral and Sigmoidal in order to facilitate effective power management in Internet of Things(IoT)wireless nodes.It has also been demonstrated,theoretically and by the use of simulations,that the Nash equilibrium does exist and that it is one of a kind.The proposed energy harvesting approach was shown,through simulations,to significantly reduce the typical amount of power thatwas sent.This is taken into consideration to agree with the objective of 5G networks.In order to converge to Nash Equilibrium(NE),the method that is advised only needs roughly 4 iterations,which makes it easier to utilise in the real world,where things aren’t always the same.