Related papers: Infection-Curing Games over Polya Contagion Networ…
The spontaneous behavioral changes of the agents during an epidemic can have significant effects on the delay and the prevalence of its spread. In this work, we study a social distancing game among the agents of a population, who determine…
This paper develops a distributed resource allocation game to study countries' pursuit of targets such as self-survival in the networked international environment. The contributions are two. First, the game formalizes countries' power…
We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent, (i) the projected…
The cost-sharing connection game is a variant of routing games on a network. In this model, given a directed graph with edge costs and edge capacities, each agent wants to construct a path from a source to a sink with low cost. The users…
In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the…
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate between other players. Our results pertain to such games…
Host-pathogen interactions consist of an attack by the pathogen, frequently a defense by the host and possibly a counter-defense by the pathogen. Here, we present a game-theoretical approach to describing such interactions. We consider a…
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players or nodes each of whom has a budget for purchasing links; each…
We introduce and study a model stemming from game theory for the spread of an epidemic throughout a given population. Each agent is allowed to choose an action whose value dictates to what extent they limit their social interactions, if at…
Algorithms for computing game-theoretic solutions have recently been applied to a number of security domains. However, many of the techniques developed for compact representations of security games do not extend to {\em Bayesian} security…
In this paper, the problem of finding a Nash equilibrium of a multi-player game is considered. The players are only aware of their own cost functions as well as the action space of all players. We develop a relatively fast algorithm within…
Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application…
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 study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on…
We study Nash equilibria for the deterministic ergodic N-players game. We introduce pure strategies, mixed strategies and Nash equilibria associated with those. We show that a Nash equilibrium in mixed strategies exists and it is a Mather…
In an inverse game problem, one needs to infer the cost function of the players in a game such that a desired joint strategy is a Nash equilibrium. We study the inverse game problem for a class of multiplayer matrix games, where the cost…
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games…
To address the dynamic nature of real-world networks, we generalize competitive diffusion games and Voronoi games from static to temporal graphs, where edges may appear or disappear over time. This establishes a new direction of studies in…
We study the issues of existence and inefficiency of pure Nash equilibria in linear congestion games with altruistic social context, in the spirit of the model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a framework,…
Motivated by the complex dynamics of cooperative and competitive interactions within networked agent systems, multi-cluster games provide a framework for modeling the interconnected goals of self-interested clusters of agents. For this…