Related papers: Strategic Network Formation with Attack and Immuni…
We study a security game over a network played between a $defender$ and $k$ $attackers$. Every attacker chooses, probabilistically, a node of the network to damage. The defender chooses, probabilistically as well, a connected induced…
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent is the distance between its ideal location and the…
If we can lower the number of people needed to vaccinate for a community to be immune against contagious diseases, we can save resources and life. A key to reach such a lower threshold of immunization is to find and vaccinate people who,…
A system relying on the collective behavior of decision-makers can be vulnerable to a variety of adversarial attacks. How well can a system operator protect performance in the face of these risks? We frame this question in the context of…
We introduce a new mechanism of connectivity evolution in networks to account for the emergence of scale-free behavior. The mechanism works on a fixed set of nodes and promotes growth from a minimally connected initial topology by the…
This paper aims to maximize algebraic connectivity of networks via topology design under the presence of constraints and an adversary. We are concerned with three problems. First, we formulate the concave maximization topology design…
We consider a class of interdependent security games on networks where each node chooses a personal level of security investment. The attack probability experienced by a node is a function of her own investment and the investment by her…
We investigate cascades in networks consisting of strategic agents with interdependent security. We assume that the strategic agents have choices between i) investing in protecting themselves, ii) purchasing insurance to transfer (some)…
In many epidemiological and ecological contexts, there is a trade-off between infections and interactions. This arises because the links between individuals capable of spreading infections are also often associated with beneficial…
When a fraction of a population becomes immune to an infectious disease, the population-wide infection risk decreases nonlinearly due to collective protection, known as herd immunity. Some studies based on mean-field models suggest that…
Being motivated by recent developments in the theory of complex networks, we examine the robustness of communication networks under intentional attack that takes down network nodes in a decreasing order of their nodal degrees. In this…
This paper concerns the consensus and formation of a network of mobile autonomous agents in adversarial settings where a group of malicious (compromised) agents are subject to deception attacks. In addition, the communication network is…
Recent years have witnessed significant advances in technologies and services in modern network applications, including smart grid management, wireless communication, cybersecurity as well as multi-agent autonomous systems. Considering the…
Creating new ties in a social network facilitates knowledge exchange and affects positional advantage. In this paper, we study the process, which we call network building, of establishing ties between two existing social networks in order…
Many interventions, such as vaccines in clinical trials or coupons in online marketplaces, must be assigned sequentially without full knowledge of their effects. Multi-armed bandit algorithms have proven successful in such settings.…
This paper studies the resilience of second-order networked dynamical systems to strategic attacks. We discuss two widely used control laws, which have applications in power networks and formation control of autonomous agents. In the first…
In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depends on both the agent's inherent utilities for other agents…
A social choice procedure is modeled as a repeated Nash game between the social agents, who are communicating with each other through a social communication network modeled by an undirected graph. The agents' criteria for this game are…
We examine settings in which agents choose behaviors and care about their neighbors' behaviors, but have incomplete information about the network in which they are embedded. We develop a model in which agents use local knowledge of their…
Building on the line of work [DIRT15a], [DIRT15b], [NS17a], [DT17], [HLS18], [HS18] we continue the study of particle systems with singular interaction through hitting times. In contrast to the previous research, we (i) consider very…