Interdependent defense games with applications to internet security at the level of autonomous systems

DOI10.3390/G8010013MaRDI QIDQ725097zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hau Chan, Michael Ceyko, Luis E. Ortiz

Publication date 1 August 2018

Published in Games (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/g8010013

zbMATH Keywords

equilibrium computationcomputational game theoryinterdependent securitylearning in gamesfully polynomial-time approximation schemeautonomous-systems internet security applicationequilibrium characterization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Dynamic programming (90C39) Games involving graphs (91A43) Internet topics (68M11) Rationality and learning in game theory (91A26)

Recommendations

• Connected subgraph defense games
• Connected subgraph defense games
• Uncertainty in interdependent security games
• How many attackers can selfish defenders catch?
• A game on a distributed network.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1233801 (Why is no real title available?)
• scientific article; zbMATH DE number 1965513 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 2243403 (Why is no real title available?)
• A random polynomial-time algorithm for approximating the volume of convex bodies
• A strategic analysis of the war against transnational terrorism
• Cascading behavior in networks: algorithmic and economic issues
• Computing optimal randomized resource allocations for massive security games
• Correlated Equilibrium as an Expression of Bayesian Rationality
• Elements of Information Theory
• Game theoretic risk analysis of security threats
• Graphical games
• Graphical models for optimal power flow
• Information Theory and Statistical Mechanics
• Interdependent security
• Nash and correlated equilibria: Some complexity considerations
• New complexity results about Nash equilibria
• Non-cooperative games
• On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
• On minmax theorems for multiplayer games
• On the complexity of the parity argument and other inefficient proofs of existence
• Probabilistic graphical models.
• Quantal response equilibria for normal form games
• Settling the complexity of computing two-player Nash equilibria
• Subjectivity and correlation in randomized strategies
• The complexity of computing a Nash equilibrium
• Uncertainty in interdependent security games

Cited in

(10)

• Cyber-physical correlation effects in defense games for large discrete infrastructures
• Interplay between security providers, consumers, and attackers: a weighted congestion game approach
• Uncertainty in interdependent security games
• Behavioral and Game-Theoretic Security Investments in Interdependent Systems Modeled by Attack Graphs
• Stackelberg security games with contagious attacks on a network: reallocation to the rescue
• Janus: A Two-Sided Analytical Model for Multi-Stage Coordinated Attacks
• Interdependent security games under behavioral probability weighting
• Interdependent Security Games on Networks Under Behavioral Probability Weighting
• A novel dynamic method in distributed network attack-defense game
• Optimal and game-theoretic deployment of security investments in interdependent assets

This page was built for publication: Interdependent defense games with applications to internet security at the level of autonomous systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725097)