A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries

Han, Chan Y.; Lunday, Brian J.; Robbins, Matthew J.

doi:10.1287/ijoc.2016.0690

Cited by 31 publications

(28 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The incentive mechanism administered by a third-party could make the ESS profile for both players be (Invest, Invest). According to the analysis in Section 4, the variable, K , should be satisfied by Equation (12). Thus, we can obtain the result that K > max (2.2, 1.5).…”

Section: Simulation Of Extended Evolutionary Modelmentioning

confidence: 97%

See 1 more Smart Citation

Sustainability of Information Security Investment in Online Social Networks: An Evolutionary Game-Theoretic Approach

2018

View full text Add to dashboard Cite

With the rapid development of information technologies, security violations in online social networks (OSN) have emerged as a critical issue. Traditional technical and organizational approaches do not consider economic factors, which are increasingly important to sustain information security investment. In this paper, we develop an evolutionary game model to study the sustainability of information security investment in OSN, and propose a quantitative approach to analyze and optimize security investment. Additionally, we examine a contract with an incentive mechanism to eliminate free riding, which helps sustain the security investment. Numerical examples are provided for illustration and simulation purposes, leading to several countermeasures and suggestions. Our analytical results show that the optimal strategy of information security investment not only is correlated with profit growth coefficients and investment costs, but is also influenced significantly by the profits from free riding. If the profit growth coefficients are prohibitively small, both OSN service providers and online platforms will not choose to sustain investment based on small profits. As profit growth coefficients increase, there is a higher probability that game players will invest. Another major finding is that the (Invest, Invest) profile is much less sensitive to the change of profit growth coefficients and the convergent speed of this scenario is faster than the other profiles. The government agency can use the proposed model to determine a proper incentive or penalty to help both parties reach the optimal strategies and thus improve OSN security.

show abstract

Section: Simulation Of Extended Evolutionary Modelmentioning

confidence: 97%

“…Game theory provides a quantitative decision framework, which can balance between the profits from and the costs of information security investment [12]. Game theory assumes each player is rational, and he/she will choose the optimal strategic choice for profits maximization, which is considered to be the most important goal.…”

mentioning

confidence: 99%

Sustainability of Information Security Investment in Online Social Networks: An Evolutionary Game-Theoretic Approach

2018

View full text Add to dashboard Cite

show abstract

“…Traditional solutions to security concerns lacked a quantitative decision structure. Game theory is considered a part of applied mathematics; it formalizes strategic interaction among independent agents that is able to offer a mathematical framework for showing security challenges in which multiplayers with inconsistent or cooperative goals are considered …”

Section: Introductionmentioning

confidence: 99%

“…Game theory is considered a part of applied mathematics; it formalizes strategic interaction among independent agents that is able to offer a mathematical framework for showing security challenges in which multiplayers with inconsistent or cooperative goals are considered. 9 In addition, game theory is able to analyze numerous scenarios before defining the suitable actions. This can be extremely beneficial for the players' decision making.…”

Section: Introductionmentioning

confidence: 99%

An evolutionary game theory–based security model in vehicular ad hoc networks

Zahedi

Farzaneh

2020

Int J Communication

View full text Add to dashboard Cite

Summary The word population is growing on a daily basis; consequently, the growth of commute and transport, developing efficient and intelligent transportation systems (ITS), has become one of the most popular requirements and the most significant attempts in modern urban areas containing large population. A key component of intelligent transportation systems is a vehicular ad hoc network. Devising internet‐based practical programs such as awareness of climatic conditions, geographical location, practical programs like on‐line payment services in the vehicular ad hoc network has led to safer driving, prevention of deadly accidents, transportation improvement, more welfare and convenience for passengers, and even offering more commercial opportunities. The special features of vehicular ad hoc network, such as intense activity, constantly‐changing topology, the vehicles' high speed, etc, will lead to challenges in gaining security. Therefore, providing vehicular ad hoc networks with security is of extreme importance in terms of users' anonymity, identification, and data privacy. In this paper, a security model is presented using a method based on evolutionary games. This method, in every vehicle, is applied as a node in the network while interacting with other vehicles; it aims at distinguishing some common attacks and defending against attackers. In this method, defending (honest) vehicles and attacking vehicles take part in an asymmetrical game; each vehicle aims at gaining the most utility and achieving its goals. The proposed method is simulated using various scenarios. The simulation results reveal that the proposed method is efficient and it reaches equilibrium and convergence at the end of the game in each scenario.

show abstract

“…Previous work by Han et al (2016) provides an initial game theoretic frame-work for the examination of the missile defense situation. Han et al (2016) formulate and solve a defender-attacker-defender extensive-form game wherein the defender first decides where to locate its SAM batteries, the attacker subsequently decides which targets to engage with a single salvo (within which multiple missiles can target a single defender asset), and then the defender makes fire control decisions to intercept the incoming attacker missiles.…”

Section: Introductionmentioning

confidence: 99%

Approximate dynamic programming for missile defense interceptor fire control

Davis

Robbins

Lunday

2017

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

Given the ubiquitous nature of both offensive and defensive missile systems, the catastrophe-causing potential they represent, and the limited resources available to countries for missile defense, optimizing the defensive response to a missile attack is a necessary national security endeavor. For a single salvo of offensive missiles launched at a set of targets, a missile defense system protecting those targets must determine how many interceptors to fire at each incoming missile. Since such missile engagements often involve the firing of more than one attack salvo, we develop a Markov decision process model to examine the optimal fire control policy for the defender. Due to the computational intractability of using exact methods for all but the smallest problem instances, we utilize an approximate dynamic programming (ADP) approach to explore the efficacy of applying approximate methods to the problem. We obtain policy insights by analyzing subsets of the state space that reflect a range of possible defender interceptor inventories. Testing of four instances derived from a representative planning scenario demonstrates that the ADP policy provides high-quality decisions for a majority of the state space, achieving a 7.74% mean optimality gap over all states for the most realistic instance, modeling a longer-term engagement by an attacker who assesses the success of each salvo before launching a subsequent one. Moreover, the ADP algorithm requires only a few minutes of computational effort versus hours for the exact dynamic programming algorithm, providing a method to address more complex and realistically-sized instances.

show abstract

A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries

Cited by 31 publications

References 15 publications

Sustainability of Information Security Investment in Online Social Networks: An Evolutionary Game-Theoretic Approach

Sustainability of Information Security Investment in Online Social Networks: An Evolutionary Game-Theoretic Approach

An evolutionary game theory–based security model in vehicular ad hoc networks

Approximate dynamic programming for missile defense interceptor fire control

Contact Info

Product

Resources

About