294 search results - page 21 / 59 » The complexity of computing a Nash equilibrium |
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
123
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
100
click to vote
SSS
2007
Springer
15 years 3 months ago
2007
Springer
System design often explores optimality of performance. What is optimal is, however, often not predefined or static in most cases, because it is affected by the context of operat...
110
click to vote
UAI
2000
14 years 11 months ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...