# A Colonel Blotto Game for Interdependence-Aware Cyber-Physical Systems   Security in Smart Cities

**Authors:** Aidin Ferdowsi, Walid Saad, Behrouz Maham, Narayan B. Mandayam

arXiv: 1705.08338 · 2017-07-18

## TL;DR

This paper models the allocation of cybersecurity resources in interdependent cyber-physical systems of smart cities using a Colonel Blotto game, highlighting how interdependencies influence optimal defense strategies and system resilience.

## Contribution

It introduces a novel game-theoretic framework for resource allocation in interdependent CPS security, considering physical, topological, and human factors in smart city environments.

## Key findings

- Defender's payoff is higher when attacker lacks awareness of interdependencies.
- Interdependent, symmetric nodes yield the highest defender payoff at equilibrium.
- Interdependencies can enhance system resilience against attacks.

## Abstract

Smart cities must integrate a number of interdependent cyber-physical systems that operate in a coordinated manner to improve the well-being of the city's residents. A cyber-physical system (CPS) is a system of computational elements controlling physical entities. Large-scale CPSs are more vulnerable to attacks due to the cyber-physical interdependencies that can lead to cascading failures which can have a significant detrimental effect on a city. In this paper, a novel approach is proposed for analyzing the problem of allocating security resources, such as firewalls and anti-malware, over the various cyber components of an interdependent CPS to protect the system against imminent attacks. The problem is formulated as a Colonel Blotto game in which the attacker seeks to allocate its resources to compromise the CPS, while the defender chooses how to distribute its resources to defend against potential attacks. To evaluate the effects of defense and attack, various CPS factors are considered including human-CPS interactions as well as physical and topological characteristics of a CPS such as flow and capacity of interconnections and minimum path algorithms. Results show that, for the case in which the attacker is not aware of the CPS interdependencies, the defender can have a higher payoff, compared to the case in which the attacker has complete information. The results also show that, in the case of more symmetric nodes, due to interdependencies, the defender achieves its highest payoff at the equilibrium compared to the case with independent, asymmetric nodes.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.08338/full.md

## Figures

3 figures with captions in the complete paper: https://tomesphere.com/paper/1705.08338/full.md

## References

17 references — full list in the complete paper: https://tomesphere.com/paper/1705.08338/full.md

---
Source: https://tomesphere.com/paper/1705.08338