Related papers: Weighted Myerson value for Network games

We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those correlated equilibria in which players' strategy choices are conditionally independently and identically distributed given some hidden…

Nearly all simulation-based games have environment parameters that affect incentives in the interaction but are not explicitly incorporated into the game model. To understand the impact of these parameters on strategic incentives, typical…

Designing optimal interdependent networks is important for the robustness and efficiency of national critical infrastructures. Here, we establish a two-person game-theoretic model in which two network designers choose to maximize the global…

This paper proposes a new lens for studying threshold games played on networks when the thresholds are heterogeneous. These are games where agents have two possible actions, and prefer action 1 if and only if enough of their neighbours…

Network games study the strategic interaction of agents connected through a network. Interventions in such a game -- actions a coordinator or planner may take that change the utility of the agents and thus shift the equilibrium action…

When opposing parties compete for a prize, the sunk effort players exert during the conflict can affect the value of the winner's reward. These spillovers can have substantial influence on the equilibrium behavior of participants in…

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

The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality it is often the case…

An active line of research has considered games played on networks in which payoffs depend on both a player's individual decision and also the decisions of her neighbors. Such games have been used to model issues including the formation of…

Purpose: We propose a model to present a possible mechanism for obtaining sizeable behavioural structures by simulating an agent based on the evolutionary public good game with available social learning. Methods: The model considered a…

We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of 'offers' based on…

Consider discrete-time linear distributed averaging dynamics, whereby agents in a network start with uncorrelated and unbiased noisy measurements of a common underlying parameter (state of the world) and iteratively update their estimates…

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…

The game-theoretic risk management framework put forth in the precursor work "Towards a Theory of Games with Payoffs that are Probability-Distributions" (arXiv:1506.07368 [q-fin.EC]) is herein extended by algorithmic details on how to…

Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The cost of traversing an edge depends on the {\em load};…

Mechanisms such as auctions and pricing schemes are utilized to design strategic (noncooperative) games for networked systems. Although the participating players are selfish, these mechanisms ensure that the game outcome is optimal with…

Exchange of services and resources in, or over, networks is attracting nowadays renewed interest. However, despite the broad applicability and the extensive study of such models, e.g., in the context of P2P networks, many fundamental…

An overview of game-theoretic approaches to energy-efficient resource allocation in wireless networks is presented. Focusing on multiple-access networks, it is demonstrated that game theory can be used as an effective tool to study resource…

We consider wireless networks that can be modeled by multiple access channels in which all the terminals are equipped with multiple antennas. The propagation model used to account for the effects of transmit and receive antenna correlations…

Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while…