Intrusion Detection Based on the Game Theory

2021 ◽  
Author(s):  
Yuqing Cheng ◽  
HaiYan Fu ◽  
Xuechao Sun
2013 ◽  
Vol 347-350 ◽  
pp. 3971-3974 ◽  
Author(s):  
Heng Xiao ◽  
Cao Fang Long

With the development of network application, network security is facing greater pressure. Based on the characteristics of intrusion detection in the wireless network of the Ad hoc working group, the article introduces the game theory, proposes a game model of network security, concluds the Nash equilibrium in the stage game, repeats game, the pareto Nash equilibrium, more attack both income and payment, so that they get the best choice.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18 ◽  
Author(s):  
Qianmu Li ◽  
Jun Hou ◽  
Shunmei Meng ◽  
Huaqiu Long

The real-time and high-continuity requirements of the edge computing network gain more and more attention because of its active defence problem, that is, a data-driven complex problem. Due to the dual constraints of the hybrid feature of edge computing networks and the uncertainty of new attack features, implementing active defence measures such as detection, evasion, trap, and control is essential for the security protection of edge computing networks with high real-time and continuity requirements. The basic idea of safe active defence is to make the defence gain more significant than the attack loss. To encounter the new attacks with uncertain features introduced by the ubiquitous transmission network in the edge computing network, this paper investigates the attack behaviour and presents an attack-defence mechanism based on game theory. Based on the idea of dynamic intrusion detection, we utilize the game theory in the field of edge computing network and suggest a data-driven mimicry intrusion detection game model-based technique called GLIDE. The game income of participants and utility computing methods under different deployment strategies are analysed in detail. According to the proof analysis of the Nash equilibrium condition in the model, the contradictory dynamic game relationship is described. Therefore, the optimal deployment strategy of the multiredundancy edge computing terminal intrusion detection service in the edge computing network is obtained by solving the game balance point. The detection probability of the edge computing network for network attacks is improved, and the cost of intrusion detection of the edge computing network is reduced.


Author(s):  
Charles Roddie

When interacting with others, it is often important for you to know what they have done in similar situations in the past: to know their reputation. One reason is that their past behavior may be a guide to their future behavior. A second reason is that their past behavior may have qualified them for reward and cooperation, or for punishment and revenge. The fact that you respond positively or negatively to the reputation of others then generates incentives for them to maintain good reputations. This article surveys the game theory literature which analyses the mechanisms and incentives involved in reputation. It also discusses how experiments have shed light on strategic behavior involved in maintaining reputations, and the adequacy of unreliable and third party information (gossip) for maintaining incentives for cooperation.


Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1443
Author(s):  
Zhiyuan Dong ◽  
Ai-Guo Wu

In this paper, we extend the quantum game theory of Prisoner’s Dilemma to the N-player case. The final state of quantum game theory of N-player Prisoner’s Dilemma is derived, which can be used to investigate the payoff of each player. As demonstration, two cases (2-player and 3-player) are studied to illustrate the superiority of quantum strategy in the game theory. Specifically, the non-unique entanglement parameter is found to maximize the total payoff, which oscillates periodically. Finally, the optimal strategic set is proved to depend on the selection of initial states.


10.5772/6232 ◽  
2008 ◽  
Vol 5 (4) ◽  
pp. 44 ◽  
Author(s):  
Yan Meng

This paper proposes a game-theory based approach in a multi–target searching using a multi-robot system in a dynamic environment. It is assumed that a rough priori probability map of the targets' distribution within the environment is given. To consider the interaction between the robots, a dynamic-programming equation is proposed to estimate the utility function for each robot. Based on this utility function, a cooperative nonzero-sum game is generated, where both pure Nash Equilibrium and mixed-strategy Equilibrium solutions are presented to achieve an optimal overall robot behaviors. A special consideration has been taken to improve the real-time performance of the game-theory based approach. Several mechanisms, such as event-driven discretization, one-step dynamic programming, and decision buffer, have been proposed to reduce the computational complexity. The main advantage of the algorithm lies in its real-time capabilities whilst being efficient and robust to dynamic environments.


2021 ◽  
Vol 14 ◽  
pp. 122-126
Author(s):  
Aleksandra L. Grinikh ◽  
◽  
Leon A. Petrosyan ◽  

In the paper n-person prisoner's dilemma on the network is investigated. A cooperative game with the pairwise interaction of players is constructed. The model is a modification of the classic 2-person prisoner's dilemma problem in the game theory. Network interaction provide an ability to take into account the in uence only to the adjacent players from the whole set of players. The feature of the game is found that allows to make a decision about necessity of playing dominated strategy by a few players. This solution is based on the number of the adjacent players. The work is a continuation of the paper published earlier by Grinikh A.L. and Petrosyan L.A. in 2021.


2019 ◽  
Vol 17 (1) ◽  
pp. 370-379
Author(s):  
Oksana Korolovych ◽  
Olha Chabaniuk ◽  
Natalia Ostapiuk ◽  
Yurii Kotviakovskyi ◽  
Nelia Gut

The conditions for doing business at this stage are often similar in a game in which you need to calculate your actions a few steps ahead. At the same time, it is important to highlight several possible current options and make the necessary decision at the control moment. Moreover, each of the options formed should be justified, understandable and take into account the risk factors and available resources.Today, the main problem of assessing and minimizing the risk of “unfriendly takeover” is due to the fact that in most cases the raider is a player who acts quite legitimately and relies on the loopholes of the current legislative framework. Therefore, it is easier to identify possible actions of the raider and to avoid them within the limits of the reverse game than to deal with the consequences.The purpose of the research is to study the specificity of the individualized assessment and minimization of the risk of “unfriendly takeover” by using elements of game theory.It has been taken into account that the effect of individualization in assessing the risk of unfriendly takeover of enterprises can possibly be achieved on the basis of the application of game theory, the elements of which provide simulation of the unfriendly takeover process within the mathematical description of the inherent combinations of attack/defence as if they actually occurred in time both within one state of the external environment and for their given set.The results allowed forming mathematical decision-making models based on the elements of the antagonistic game “raider-target enterprise” and “raider games with the external environment”, which proved the possibility to: 1) identify possible functions of wins/losses; 2) combinations of attacks that can be neglected (that is, from the point of view of the rationality of decisions, will be rejected by the raider); 3) the ranking of the raider’s “attack combinations” for the reliability of their use during “unfriendly takeover”. Under such conditions, the target company can provide not only a detailed assessment, but also an effective minimization of the risk of “unfriendly takeover” and allocate the best combination of protection.


Sign in / Sign up

Export Citation Format

Share Document