63 search results - page 6 / 13 » The computational complexity of nash equilibria in concisely... |
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CMSB
2006
Springer
13 years 11 months ago
2006
Springer
We present a game-theoretic foundation for gene regulatory analysis based on the recent formalism of rewriting game theory. Rewriting game theory is discrete and comes with a graph...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
DIALM
2003
ACM
14 years 21 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...