Sciweavers

54 search results - page 1 / 11
» Complexity Results about Nash Equilibria
Sort
View
IJCAI
2003
13 years 6 months ago
Complexity Results about Nash Equilibria
Vincent Conitzer, Tuomas Sandholm
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 6 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
WINE
2005
Springer
124views Economy» more  WINE 2005»
13 years 10 months ago
New Results on the Complexity of Uniformly Mixed Nash Equilibria
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
TCS
2008
13 years 5 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
13 years 11 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
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...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...