Related papers: Weighted Myerson value for Network games

Whilst network coordination games and network anti-coordination games have received a considerable amount of attention in the literature, network games with coexisting coordinating and anti-coordinating players are known to exhibit more…

In this paper a new multiple access algorithm for cognitive radio networks based on game theory is presented. We address the problem of a multiple access system where the number of users and their types are unknown. In order to do this, the…

In recent work by Bramoull\'{e} and Kranton, a model for the provision of public goods on a network was presented and relations between equilibria of such a game and properties of the network were established. This model was further…

This paper investigates design of noncooperative games from an optimization and control theoretic perspective. Pricing mechanisms are used as a design tool to ensure that the Nash equilibrium of a fairly general class of noncooperative…

Players allocate their budget to links, a local public good and a private good. A player links to free ride on others' public good provision. We derive sufficient conditions for the existence of a Nash equilibrium. In equilibrium, large…

We consider an attacker-operator game for monitoring a large-scale network that is comprised on components that differ in their criticality levels. In this zero-sum game, the operator seeks to position a limited number of sensors to monitor…

This paper presents a game theoretic solution for joint channel allocation and power control in cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the…

We consider a nonzero-sum N-player Markov game on an abstract measurable state space with compact metric action spaces. The payoff functions are bounded Carath\'eodory functions and the transitions of the system are assumed to have a…

We consider the framework of average aggregative games, where the cost function of each agent depends on his own strategy and on the average population strategy. We focus on the case in which the agents are coupled not only via their cost…

This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method presented in [4] to…

We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a…

We study a network formation game where nodes wish to send traffic to other nodes. Nodes can contract bilaterally other nodes to form bidirectional links as well as nodes can break unilaterally contracts to eliminate the corresponding…

We study a model of strategic coordination based on a class of games with incomplete information known as Global Games. Under the assumption of Poisson-distributed signals and a Gamma prior distribution on state of the system, we…

We study the mechanism design problem of allocating a set of indivisible items without monetary transfers. Despite the vast literature on this very standard model, it still remains unclear how do truthful mechanisms look like. We focus on…

A game-theoretic approach for studying power control in multiple-access networks with transmission delay constraints is proposed. A non-cooperative power control game is considered in which each user seeks to choose a transmit power that…

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…

We study the robust Nash equilibrium (RNE) for a class of games in communications systems and networks where the impact of users on each other is an additive function of their strategies. Each user measures this impact, which may be…

This paper addresses the distributed Nash Equilibrium seeking problem for aggregative games, where legitimate players' decisions are affected by potential malicious players. To describe players' behavior, we introduce a novel heterogeneous…

We introduce Game networks (G nets), a novel representation for multi-agent decision problems. Compared to other game-theoretic representations, such as strategic or extensive forms, G nets are more structured and more compact; more…

This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…