Factored markov game theory for secure interdependent infrastructure networks

Linan Huang, Juntao Chen, Quanyan Zhu

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

With the integration of modern information and communication technologies (ICTs) into critical infrastructures (CIs) such as 5G networks and the Internet of Things (IoTs), the CIs are becoming vulnerable to cyber threats at the same time improving its connectivity and functionalities. Hence it is essential to understand the risk of ICTs on CIs holistically as a cyber-physical system and design efficient security hardening mechanisms to reduce the cyber risks. To this end, we establish a game-theoretic framework to capture the system behaviors of the CIs under malicious attacks and the security design objectives. We propose the factored Markov game theory to enable a computationally scalable model of large-scale infrastructure networks and provide approximate algorithms for designing optimal mechanisms. The proposed theory builds on the factored graph that exploits the dependency structure of the nodes of CIs and the approximate dynamic programming tools for stochastic Markov games. This work focuses on a localized information structure and the single-controller game solvable by linear programming. Numerical results illustrate the proper trade-off of the approximation accuracy and computation complexity in the new design paradigm and show the proactive security at the time of unanticipated attacks.

Original languageEnglish (US)
Title of host publicationStatic and Dynamic Game Theory
Subtitle of host publicationFoundations and Applications
PublisherBirkhauser
Pages99-126
Number of pages28
DOIs
StatePublished - Jan 1 2018

Publication series

NameStatic and Dynamic Game Theory: Foundations and Applications
VolumePart F2
ISSN (Print)2363-8516
ISSN (Electronic)2363-8524

Fingerprint

Critical infrastructures
Critical Infrastructure
Game theory
Game Theory
Infrastructure
Information and Communication Technology
Game
Attack
Approximate Dynamic Programming
Localized Structures
Internet of Things
Approximate Algorithm
Information Structure
Communication
Hardening
Dynamic programming
Linear programming
Connectivity
Trade-offs
Paradigm

ASJC Scopus subject areas

  • Statistics, Probability and Uncertainty
  • Statistics and Probability
  • Applied Mathematics

Cite this

Huang, L., Chen, J., & Zhu, Q. (2018). Factored markov game theory for secure interdependent infrastructure networks. In Static and Dynamic Game Theory: Foundations and Applications (pp. 99-126). (Static and Dynamic Game Theory: Foundations and Applications; Vol. Part F2). Birkhauser. https://doi.org/10.1007/978-3-319-75268-6_5

Factored markov game theory for secure interdependent infrastructure networks. / Huang, Linan; Chen, Juntao; Zhu, Quanyan.

Static and Dynamic Game Theory: Foundations and Applications. Birkhauser, 2018. p. 99-126 (Static and Dynamic Game Theory: Foundations and Applications; Vol. Part F2).

Research output: Chapter in Book/Report/Conference proceedingChapter

Huang, L, Chen, J & Zhu, Q 2018, Factored markov game theory for secure interdependent infrastructure networks. in Static and Dynamic Game Theory: Foundations and Applications. Static and Dynamic Game Theory: Foundations and Applications, vol. Part F2, Birkhauser, pp. 99-126. https://doi.org/10.1007/978-3-319-75268-6_5
Huang L, Chen J, Zhu Q. Factored markov game theory for secure interdependent infrastructure networks. In Static and Dynamic Game Theory: Foundations and Applications. Birkhauser. 2018. p. 99-126. (Static and Dynamic Game Theory: Foundations and Applications). https://doi.org/10.1007/978-3-319-75268-6_5
Huang, Linan ; Chen, Juntao ; Zhu, Quanyan. / Factored markov game theory for secure interdependent infrastructure networks. Static and Dynamic Game Theory: Foundations and Applications. Birkhauser, 2018. pp. 99-126 (Static and Dynamic Game Theory: Foundations and Applications).
@inbook{ad036b6222904f11b11501af34fcd704,
title = "Factored markov game theory for secure interdependent infrastructure networks",
abstract = "With the integration of modern information and communication technologies (ICTs) into critical infrastructures (CIs) such as 5G networks and the Internet of Things (IoTs), the CIs are becoming vulnerable to cyber threats at the same time improving its connectivity and functionalities. Hence it is essential to understand the risk of ICTs on CIs holistically as a cyber-physical system and design efficient security hardening mechanisms to reduce the cyber risks. To this end, we establish a game-theoretic framework to capture the system behaviors of the CIs under malicious attacks and the security design objectives. We propose the factored Markov game theory to enable a computationally scalable model of large-scale infrastructure networks and provide approximate algorithms for designing optimal mechanisms. The proposed theory builds on the factored graph that exploits the dependency structure of the nodes of CIs and the approximate dynamic programming tools for stochastic Markov games. This work focuses on a localized information structure and the single-controller game solvable by linear programming. Numerical results illustrate the proper trade-off of the approximation accuracy and computation complexity in the new design paradigm and show the proactive security at the time of unanticipated attacks.",
author = "Linan Huang and Juntao Chen and Quanyan Zhu",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-75268-6_5",
language = "English (US)",
series = "Static and Dynamic Game Theory: Foundations and Applications",
publisher = "Birkhauser",
pages = "99--126",
booktitle = "Static and Dynamic Game Theory",

}

TY - CHAP

T1 - Factored markov game theory for secure interdependent infrastructure networks

AU - Huang, Linan

AU - Chen, Juntao

AU - Zhu, Quanyan

PY - 2018/1/1

Y1 - 2018/1/1

N2 - With the integration of modern information and communication technologies (ICTs) into critical infrastructures (CIs) such as 5G networks and the Internet of Things (IoTs), the CIs are becoming vulnerable to cyber threats at the same time improving its connectivity and functionalities. Hence it is essential to understand the risk of ICTs on CIs holistically as a cyber-physical system and design efficient security hardening mechanisms to reduce the cyber risks. To this end, we establish a game-theoretic framework to capture the system behaviors of the CIs under malicious attacks and the security design objectives. We propose the factored Markov game theory to enable a computationally scalable model of large-scale infrastructure networks and provide approximate algorithms for designing optimal mechanisms. The proposed theory builds on the factored graph that exploits the dependency structure of the nodes of CIs and the approximate dynamic programming tools for stochastic Markov games. This work focuses on a localized information structure and the single-controller game solvable by linear programming. Numerical results illustrate the proper trade-off of the approximation accuracy and computation complexity in the new design paradigm and show the proactive security at the time of unanticipated attacks.

AB - With the integration of modern information and communication technologies (ICTs) into critical infrastructures (CIs) such as 5G networks and the Internet of Things (IoTs), the CIs are becoming vulnerable to cyber threats at the same time improving its connectivity and functionalities. Hence it is essential to understand the risk of ICTs on CIs holistically as a cyber-physical system and design efficient security hardening mechanisms to reduce the cyber risks. To this end, we establish a game-theoretic framework to capture the system behaviors of the CIs under malicious attacks and the security design objectives. We propose the factored Markov game theory to enable a computationally scalable model of large-scale infrastructure networks and provide approximate algorithms for designing optimal mechanisms. The proposed theory builds on the factored graph that exploits the dependency structure of the nodes of CIs and the approximate dynamic programming tools for stochastic Markov games. This work focuses on a localized information structure and the single-controller game solvable by linear programming. Numerical results illustrate the proper trade-off of the approximation accuracy and computation complexity in the new design paradigm and show the proactive security at the time of unanticipated attacks.

UR - http://www.scopus.com/inward/record.url?scp=85052370934&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052370934&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-75268-6_5

DO - 10.1007/978-3-319-75268-6_5

M3 - Chapter

T3 - Static and Dynamic Game Theory: Foundations and Applications

SP - 99

EP - 126

BT - Static and Dynamic Game Theory

PB - Birkhauser

ER -