Games theory and the development of research paper publishing

Along with rapid development of Chinese university, series of disadvantages are brought in research papers publishing. From the study of Games theory, this article tries to find out a way to adjust the rules of the game, to refine the science research environment, improve the quality of research paper, and then realize the sustainable development of Chinese universities.

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.

Game theory attack pricing for mining pools in blockchain-based IoT

The malicious mining pool can sacrifice part of its revenue to employ the computing power of blockchain network.The employed computing power carries out the pool mining attacks on the attacked mining pool.To realize the win-win game between the malicious mining pool and the employee,the paper proposes an Employment Attack Pricing Algorithm(EAPA)of mining pools in blockchain based on game theory.In the EAPA,the paper uses mathematical formulas to express the revenue of malicious mining pools under the employment attack,the revenue increment of malicious mining pools,and the revenue of the employee.It establishes a game model between the malicious mining pool and the employee under the employment attack.Then,the paper proposes an optimal computing power price selection strategy of employment attack based on model derivation.In the strategy,the malicious mining pool analyzes the conditions for the employment attack,and uses the derivative method to find the optimal utilization value of computing power,employees analyze the conditions for accepting employment,and use the derivative method to find the optimal reward value of computing power.Finally,the strategy finds the optimal employment computing power price to realize Nash equilibrium between the malicious mining pool and the employee under the current computing power allocation.The simulation results show that the EAPA could find the employment computing power price that realizes the win-win game between the malicious mining pool and the employee.The EAPA also maximizes the unit computing power revenue of employment and the unit computing power revenue of honest mining in malicious mining pool at the same time.The EAPA outperforms the state-of-the-art methods such as SPSUCP,DPSACP,and FPSUCP.

Game theory in network security for digital twins in industry

To ensure the safe operation of industrial digital twins network and avoid the harm to the system caused by hacker invasion,a series of discussions on network security issues are carried out based on game theory.From the perspective of the life cycle of network vulnerabilities,mining and repairing vulnerabilities are analyzed by applying evolutionary game theory.The evolution process of knowledge sharing among white hats under various conditions is simulated,and a game model of the vulnerability patch cooperative development strategy among manufacturers is constructed.On this basis,the differential evolution is introduced into the update mechanism of the Wolf Colony Algorithm(WCA)to produce better replacement individuals with greater probability from the perspective of both attack and defense.Through the simulation experiment,it is found that the convergence speed of the probability(X)of white Hat 1 choosing the knowledge sharing policy is related to the probability(x0)of white Hat 2 choosing the knowledge sharing policy initially,and the probability(y0)of white hat 2 choosing the knowledge sharing policy initially.When y0?0.9,X converges rapidly in a relatively short time.When y0 is constant and x0 is small,the probability curve of the“cooperative development”strategy converges to 0.It is concluded that the higher the trust among the white hat members in the temporary team,the stronger their willingness to share knowledge,which is conducive to the mining of loopholes in the system.The greater the probability of a hacker attacking the vulnerability before it is fully disclosed,the lower the willingness of manufacturers to choose the"cooperative development"of vulnerability patches.Applying the improved wolf colonyco-evolution algorithm can obtain the equilibrium solution of the"attack and defense game model",and allocate the security protection resources according to the importance of nodes.This study can provide an effective solution to protect the network security for digital twins in the industry.

Diversified and compatible web APIs recommendation based on game theory in IoT

With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can be accessible remotely.In this context,finding and writing a list of existing Web APIs that can collectively meet the functional needs of software developers has become a promising approach to economically and easily develop successful mobile applications.However,the number and diversity of candidate IoT Web APIs places an additional burden on application developers’Web API selection decisions,as it is often a challenging task to simultaneously ensure the diversity and compatibility of the final set of Web APIs selected.Considering this challenge and latest successful applications of game theory in IoT,a Diversified and Compatible Web APIs Recommendation approach,namely DivCAR,is put forward in this paper.First of all,to achieve API diversity,DivCAR employs random walk sampling technique on a pre-built“API-API”correlation graph to generate diverse“API-API”correlation subgraphs.Afterwards,with the diverse“API-API”correlation subgraphs,the compatible Web APIs recommendation problem is modeled as a minimum group Steiner tree search problem.A sorted set of multiple compatible and diverse Web APIs are returned to the application developer by solving the minimum group Steiner tree search problem.At last,a set of experiments are designed and implemented on a real dataset crawled from www.programmableweb.com.Experimental results validate the effectiveness and efficiency of our proposed DivCAR approach in balancing the Web APIs recommendation diversity and compatibility.

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.

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 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.

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.

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.

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.

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.

Recognition and interfere deceptive behavior based on inverse reinforcement learning and game theory

In real-time strategy(RTS)games,the ability of recognizing other players’goals is important for creating artifical intelligence(AI)players.However,most current goal recognition methods do not take the player’s deceptive behavior into account which often occurs in RTS game scenarios,resulting in poor recognition results.In order to solve this problem,this paper proposes goal recognition for deceptive agent,which is an extended goal recognition method applying the deductive reason method(from general to special)to model the deceptive agent’s behavioral strategy.First of all,the general deceptive behavior model is proposed to abstract features of deception,and then these features are applied to construct a behavior strategy that best matches the deceiver’s historical behavior data by the inverse reinforcement learning(IRL)method.Final,to interfere with the deceptive behavior implementation,we construct a game model to describe the confrontation scenario and the most effective interference measures.

Energy Efficient Networks Using Ant Colony Optimization with Game Theory Clustering

Real-time applications based on Wireless Sensor Network(WSN)tech-nologies quickly lead to the growth of an intelligent environment.Sensor nodes play an essential role in distributing information from networking and its transfer to the sinks.The ability of dynamical technologies and related techniques to be aided by data collection and analysis across the Internet of Things(IoT)network is widely recognized.Sensor nodes are low-power devices with low power devices,storage,and quantitative processing capabilities.The existing system uses the Artificial Immune System-Particle Swarm Optimization method to mini-mize the energy and improve the network’s lifespan.In the proposed system,a hybrid Energy Efficient and Reliable Ant Colony Optimization(ACO)based on the Routing protocol(E-RARP)and game theory-based energy-efficient clus-tering algorithm(GEC)were used.E-RARP is a new Energy Efficient,and Reli-able ACO-based Routing Protocol for Wireless Sensor Networks.The suggested protocol provides communications dependability and high-quality channels of communication to improve energy.For wireless sensor networks,a game theo-ry-based energy-efficient clustering technique(GEC)is used,in which each sen-sor node is treated as a player on the team.The sensor node can choose beneficial methods for itself,determined by the length of idle playback time in the active phase,and then decide whether or not to rest.The proposed E-RARP-GEC improves the network’s lifetime and data transmission;it also takes a minimum amount of energy compared with the existing algorithms.

Cooperative game theory-based steering law design of a CMG system

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.

Energy-Efficient Clustering Using Optimization with Locust Game Theory

Wireless sensor networks(WSNs)are made up of several sensors located in a specific area and powered by a finite amount of energy to gather environmental data.WSNs use sensor nodes(SNs)to collect and transmit data.However,the power supplied by the sensor network is restricted.Thus,SNs must store energy as often as to extend the lifespan of the network.In the proposed study,effective clustering and longer network lifetimes are achieved using mul-ti-swarm optimization(MSO)and game theory based on locust search(LS-II).In this research,MSO is used to improve the optimum routing,while the LS-II approach is employed to specify the number of cluster heads(CHs)and select the best ones.After the CHs are identified,the other sensor components are allo-cated to the closest CHs to them.A game theory-based energy-efficient clustering approach is applied to WSNs.Here each SN is considered a player in the game.The SN can implement beneficial methods for itself depending on the length of the idle listening time in the active phase and then determine to choose whether or not to rest.The proposed multi-swarm with energy-efficient game theory on locust search(MSGE-LS)efficiently selects CHs,minimizes energy consumption,and improves the lifetime of networks.The findings of this study indicate that the proposed MSGE-LS is an effective method because its result proves that it increases the number of clusters,average energy consumption,lifespan extension,reduction in average packet loss,and end-to-end delay.

Game Theory-Based Dynamic Weighted Ensemble for Retinal Disease Classification

An automated retinal disease detection system has long been in exis-tence and it provides a safe,no-contact and cost-effective solution for detecting this disease.This paper presents a game theory-based dynamic weighted ensem-ble of a feature extraction-based machine learning model and a deep transfer learning model for automatic retinal disease detection.The feature extraction-based machine learning model uses Gaussian kernel-based fuzzy rough sets for reduction of features,and XGBoost classifier for the classification.The transfer learning model uses VGG16 or ResNet50 or Inception-ResNet-v2.A novel ensemble classifier based on the game theory approach is proposed for the fusion of the outputs of the transfer learning model and the XGBoost classifier model.The ensemble approach significantly improves the accuracy of retinal disease pre-diction and results in an excellent performance when compared to the individual deep learning and feature-based models.

Joint Optimization of Imperfect Preventive Maintenance and Production Scheduling for Single Machine Based on Game Theory Method

In this study,an optimization model of a single machine system integrating imperfect preventive maintenance planning and production scheduling based on game theory is proposed.The costs of the production department and the maintenance department are minimized,respectively.Two kinds of three-stage dynamic game models and a backward induction method are proposed to determine the preventive maintenance(PM)threshold.A lemma is presented to obtain the exact solution.A comprehensive numerical study is provided to illustrate the proposed maintenance model.The effectiveness is also validated by comparison with other two existed optimization models.

Computation of PoA for Selfish Node Detection and Resource Allocation Using Game Theory

The introduction of new technologies has increased communication network coverage and the number of associating nodes in dynamic communication networks(DCN).As the network has the characteristics like decentralized and dynamic,few nodes in the network may not associate with other nodes.These uncooperative nodes also known as selfish nodes corrupt the performance of the cooperative nodes.Namely,the nodes cause congestion,high delay,security concerns,and resource depletion.This study presents an effective selfish node detection method to address these problems.The Price of Anarchy(PoA)and the Price of Stability(PoS)in Game Theory with the Presence of Nash Equilibrium(NE)are discussed for the Selfish Node Detection.This is a novel experiment to detect selfish nodes in a network using PoA.Moreover,the least response dynamic-based Capacitated Selfish Resource Allocation(CSRA)game is introduced to improve resource usage among the nodes.The suggested strategy is simulated using the Solar Winds simulator,and the simulation results show that,when compared to earlier methods,the new scheme offers promising performance in terms of delivery rate,delay,and throughput.