We show that deciding the existence of a Nash equilibrium for a given graph is NP-hard. We also introduce a new measure, the social cost discrepancy, defined as the ratio of the costs between the worst and the best Nash equilibria. We show that the social cost discrepancy in our game ...
We show that deciding the existence of a Nash equilibrium for a given graph is NP-hard which to our knowledge is the first result of this kind for a zero-sum game. We also introduce a new measure, the social cost discrepancy, defined as the ratio of the costs between the worst and ...
Definition 1.1 (Nash Equilibrium).如果x∗∈X满足∀i∈1,...,N,∀xi∈Xi,θi(xi,x−i∗)≤θi(xi∗,x−i∗),x∗则是一个纳什均衡。 在常规的纳什博弈(Nash Equilibrium Problem,NEP)里,玩家们的策略是耦合在效用函数θi里的,θi既是xi的函数,也是x−i的函数。玩家们的策略集是...
This graph describes a system of "neighborhood dependence" of the evolution of a random process described by local and synchronously change of state of vertices, depending on the decisions made in them. The main attention is paid to solving the problem of finding a Nash equilibrium for ...
We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the players' cost functions may be affected by the actions of any subset of players. An interference graph is employed...
In this section, we first solve our Nash equilibrium seeking problem for the weight-balanced digraphs and then extend the derived results to general strongly connected ones with unbalanced weights. 4.1 Weight-balanced graph To begin with, we make the following extra assumption:Assumption...
In order to prove the existence of an equilibrium point in a finite N -person game we will need the Brouwer Fixed Point Theorem which in turn needs Sperner's Lemma. We will use an analogy from a common practice in building wire-frames in order to get into graph theory gently. For this...
摘要原文 This brief proposes a novel decision-making model for generalized Nash equilibrium seeking in the context of full-potential population games under capacity and migration constraints. The capacity constraints restrict the mass of players that are allowed to simultaneously play each strategy of th...
This paper provides an extended analysis of an equilibrium concept for non-cooperative games with boundedly rational players: Nash-2 equilibrium. Players think one step ahead and account for all profitable responses of player-specific subsets of opponents because of both the cognitive limitations on pr...
Complexity of Equilibrium in Diffusion Games on Social Networks In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirect... SR Etesami,T Basar - 《Automatica》 被引量: 19发表: 2015年 Multiparty ...