14 search results - page 2 / 3 » New Results on the Complexity of Uniformly Mixed Nash Equili... |
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
AAAI
2006
13 years 6 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We propose a new class of game-theoretic models for network formation in which strategies are not directly related to edge choices, but instead correspond more generally to the ex...