Related papers: Connected Subgraph Defense Games
We study in this paper privacy protection in fully distributed Nash equilibrium seeking where a player can only access its own cost function and receive information from its immediate neighbors over a directed communication network. In view…
We study strong stability of Nash equilibria in load balancing games of m (m >= 2) identical servers, in which every job chooses one of the m servers and each job wishes to minimize its cost, given by the workload of the server it chooses.…
Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…
We consider the dynamic behavior of several variants of the Network Creation Game, introduced by Fabrikant et al. [PODC'03]. Equilibrium networks in these models have desirable properties like low social cost and small diameter, which makes…
This paper proposes a game-theoretic approach to address the problem of optimal sensor placement against an adversary in uncertain networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…
We present a resource-planning game for cyber-security of networked control systems (NCS). The NCS is assumed to be operating in closed-loop using a linear state-feedback $\mathcal{H}_2$ controller. A zero-sum, two-player Stackelberg game…
In this paper, we propose a game between an exogenous adversary and a network of agents connected via a multigraph. The multigraph is composed of (1) a global graph structure, capturing the virtual interactions among the agents, and (2) a…
We consider the classic motion planning problem defined over a roadmap in which a vehicle seeks to find an optimal path from a source to a destination in presence of an attacker who can launch attacks on the vehicle over any edge of the…
We study a variant of pursuit-evasion game in the context of perimeter defense. In this problem, the intruder aims to reach the base plane of a hemisphere without being captured by the defender, while the defender tries to capture the…
A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time…
We study the strategic formation of multi-layer networks, where each layer represents a different type of relationship between the nodes in the network and is designed to maximize some utility that depends on the topology of that layer and…
We study a network formation game where $n$ players, identified with the nodes of a directed graph to be formed, choose where to wire their outgoing links in order to maximize their PageRank centrality. Specifically, the action of every…
This article focuses on the security assessment of electricity Distribution Networks (DNs) with vulnerable Distributed Energy Resource (DER) nodes. The adversary model is simultaneous compromise of DER nodes by strategic manipulation of…
An adversary looking to disrupt a power grid may look to target certain substations and sources of power generation to initiate a cascading failure that maximizes the number of customers without electricity. This is particularly an…
The increasingly pervasive connectivity of today's information systems brings up new challenges to security. Traditional security has accomplished a long way toward protecting well-defined goals such as confidentiality, integrity,…
Active Directory (AD) is the default security management system for Windows domain networks. We study a Stackelberg game model between one attacker and one defender on an AD attack graph. The attacker initially has access to a set of entry…
Network games provide a powerful framework for modeling agent interactions in networked systems, where players are represented by nodes in a graph and their payoffs depend on the actions taken by their neighbors. Extending the framework of…
In this work, we investigate an application of a Nash equilibrium seeking algorithm in a social network. In a networked game each player (user) takes action in response to other players' actions in order to decrease (increase) his cost…
This paper proposes a distributed algorithm to find the Nash equilibrium in a class of non-cooperative convex games with partial-decision information. Our method employs a distributed projected gradient play approach alongside consensus…
This paper investigates strategic interactions within a three party deception security game involving a defender, an insider, and external attackers. We propose a robust deception mechanism where the leader manipulates game parameters…