Related papers: A Cyber-Security Investment Game for Networked Con…
This work studies the decentralized and uncoordinated energy source selection problem for smart-grid consumers with heterogeneous energy profiles and risk attitudes: they compete for a limited amount of renewable energy in their local…
This paper considers the distributed strategy design for Nash equilibrium (NE) seeking in multi-cluster games under a partial-decision information scenario. In the considered game, there are multiple clusters and each cluster consists of a…
Power management is one of the vital issue in wireless sensor networks, where the lifetime of the network relies on battery powered nodes. Transmitting at high power reduces the lifetime of both the nodes and the network. One efficient way…
In this paper, we first consider a pinning node selection and control gain co-design problem for complex networks. A necessary and sufficient condition for the synchronization of the pinning controlled networks at a homogeneous state is…
Infrastructure networks are vulnerable to both cyber and physical attacks. Building a secure and resilient networked system is essential for providing reliable and dependable services. To this end, we establish a two-player three-stage game…
The Stackelberg security game is played between a defender and an attacker, where the defender needs to allocate a limited amount of resources to multiple targets in order to minimize the loss due to adversarial attack by the attacker.…
When modeling robot interactions as Nash equilibrium problems, it is desirable to place coupled constraints which restrict these interactions to be safe and acceptable (for instance, to avoid collisions). Such games are continuous with…
Selecting the combination of security controls that will most effectively protect a system's assets is a difficult task. If the wrong controls are selected, the system may be left vulnerable to cyber-attacks that can impact the…
We present a framework for computing approximate mixed-strategy Nash equilibria of continuous-action games. It is a modification of the traditional double oracle algorithm, extended to multiple players and continuous action spaces. Unlike…
We study reinforcement learning for two-player zero-sum Markov games with simultaneous moves in the finite-horizon setting, where the transition kernel of the underlying Markov games can be parameterized by a linear function over the…
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…
In this work, we consider a network composed of several single-antenna transmitter-receiver pairs in which each pair aims at selfishly minimizing the power required to achieve a given signal-to-interference-plus-noise ratio. This is…
Ensuring the security of networked systems is a significant problem, considering the susceptibility of modern infrastructures and technologies to adversarial interference. A central component of this problem is how defensive resources…
Pseudo-games are a natural and well-known generalization of normal-form games, in which the actions taken by each player affect not only the other players' payoffs, as in games, but also the other players' strategy sets. The solution…
The problem of the distributed Nash equilibrium seeking for aggregative games has been studied over strongly connected and weight-balanced static networks and every time strongly connected and weight-balanced switching networks. In this…
This paper focuses on the issue of energy efficiency in wireless data networks through a game theoretic approach. The case considered is that in which each user is allowed to vary its transmit power, spreading code, and uplink receiver in…
In this work, we investigate the distributed generalized Nash equilibrium (GNE) seeking problems for $N$-coalition games with inequality constraints. First, we study the scenario where each agent in a coalition has full information of all…
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…
This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…
Massive machine-type communication (mMTC) is a new focus of services in fifth generation (5G) communication networks. The associated stringent delay requirement of end-to-end (E2E) service deliveries poses technical challenges. In this…