294 search results - page 39 / 59 » The complexity of computing a Nash equilibrium |
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
COLCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
When two sponsoring organizations, working towards separate goals, can employ wireless sensor networks for a finite period of time, it can be efficiency-enhancing for the sponso...
101
click to vote
ESA
2009
Springer
15 years 4 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...