Sciweavers

170 search results - page 13 / 34
» Parallel Computation of Nash Equilibria in N-Player Games
Sort
View
ICALP
2004
Springer
14 years 1 months ago
Nash Equilibria in Discrete Routing Games with Convex Latency Functions
Martin Gairing, Thomas Lücking, Marios Mavron...
CMSB
2006
Springer
13 years 11 months ago
Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation
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...
Chafika Chettaoui, Franck Delaplace, Pierre Lescan...
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 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...
FOCS
2007
IEEE
14 years 2 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ATAL
2006
Springer
13 years 11 months ago
A technique for reducing normal-form games to compute a Nash equilibrium
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
Vincent Conitzer, Tuomas Sandholm