Sciweavers

176 search results - page 11 / 36
» Decision Problems for Nash Equilibria in Stochastic Games
Sort
View
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 13 days ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
ICALP
2007
Springer
13 years 11 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
ECAI
2010
Springer
13 years 8 months ago
The Dynamics of Multi-Agent Reinforcement Learning
Abstract. Infinite-horizon multi-agent control processes with nondeterminism and partial state knowledge have particularly interesting properties with respect to adaptive control, ...
Luke Dickens, Krysia Broda, Alessandra Russo
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