3504 search results - page 9 / 701 » Computational Aspects of Equilibria |
TCS
2008
13 years 8 months ago
2008
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 ...
JUCS
2010
13 years 3 months ago
2010
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
CCA
2009
Springer
14 years 3 months ago
2009
Springer
TARK
2009
Springer
14 years 3 months ago
2009
Springer
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
SIGECOM
2006
ACM
14 years 2 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...