Sciweavers

144 search results - page 12 / 29
» Computing Nash Equilibria of Action-Graph Games
Sort
View
IPL
2006
92views more  IPL 2006»
15 years 1 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
109
Voted
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 7 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ICALP
2004
Springer
15 years 7 months ago
Nash Equilibria in Discrete Routing Games with Convex Latency Functions
Martin Gairing, Thomas Lücking, Marios Mavron...
CMSB
2006
Springer
15 years 5 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...
FOCS
2007
IEEE
15 years 8 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