Sciweavers

144 search results - page 1 / 29
» Computing Nash Equilibria of Action-Graph Games
Sort
View
UAI
2004
13 years 7 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 6 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
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...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
JUCS
2010
133views more  JUCS 2010»
13 years 1 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
JUCS
2010
160views more  JUCS 2010»
13 years 1 months ago
How Incomputable is Finding Nash Equilibria?
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...
Arno Pauly