Related papers: Semidefinite network games: multiplayer minimax an…

We propose a framework to compute approximate Nash equilibria in integer programming games with nonlinear payoffs, i.e., simultaneous and non-cooperative games where each player solves a parametrized mixed-integer nonlinear program. We…

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…

We present a new approach to solving games with a countably or uncountably infinite number of players. Such games are often used to model multiagent systems with a large number of agents. The latter are frequently encountered in economics,…

Network games have been instrumental in understanding strategic behaviors over networks for applications such as critical infrastructure networks, social networks, and cyber-physical systems. One critical challenge of network games is that…

In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…

We investigate the sensitivity of the Nash equilibrium of constrained network aggregative games to changes in exogenous parameters affecting the cost function of the players. This setting is motivated by two applications. The first is the…

We consider a game for a continuum of non-identical players evolving on a finite state space. Their heterogeneous interactions are represented by a graphon, which can be viewed as the limit of a dense random graph. The player's transition…

In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed…

We consider a weighted Shapley network design game, where selfish players choose paths in a network to minimize their cost. The cost function of each edge in the network is affine linear with respect to the sum of weights of the players who…

We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and…

We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding locations to find multiple items hidden by a hider. Each hiding location has a maximum hiding capacity and a probability of detecting its hidden…

We study the consequences of adopting products by agents who form a social network. To this end we use the threshold model introduced in Apt and Markakis, arXiv:1105.2434, in which the nodes influenced by their neighbours can adopt one out…

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…

We analyze the robustness of (pure strategy) Nash equilibria for network games against perturbations of the players' utility functions. We first derive a simple characterization of the margin of robustness, defined as the minimum magnitude…

The objective of this paper is to identify and analyze the response actions of a set of players embedded in sub-networks in the context of interaction and learning. We characterize strategic network formation as a static game of…

This paper studies the existence of pure Nash equilibria in resource graph games, which are a general class of strategic games used to succinctly represent the players' private costs. There is a finite set of resources and the strategy set…

Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation processes, which in turn are the theoretical counterpart of…

Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…

In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…

In this paper, we study the problem of the distributed Nash equilibrium seeking of N-player games over jointly strongly connected switching networks. The action of each player is governed by a class of uncertain nonlinear systems. Our…