3504 search results - page 22 / 701 » Computational Aspects of Equilibria |
FMCO
2004
Springer
14 years 2 months ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...
CSL
2009
Springer
14 years 3 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...
WINE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
DIALM
2003
ACM
14 years 1 months 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...
COLCOM
2005
IEEE
14 years 2 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...