Sciweavers

374 search results - page 7 / 75
» Generalized Nash equilibrium problems
Sort
View
TRANSCI
2010
104views more  TRANSCI 2010»
13 years 2 months ago
Equilibrium Results for Dynamic Congestion Games
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
Frédéric Meunier, Nicolas Wagner
AI
2006
Springer
13 years 11 months ago
Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games
So far, most equilibrium concepts in game theory require that the rewards and actions of the other agents are known and/or observed by all agents. However, in real life problems, a...
Stéphane Ross, Brahim Chaib-draa
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
STACS
2007
Springer
14 years 1 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer
AI
2004
Springer
13 years 7 months ago
Efficient learning equilibrium
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...
Ronen I. Brafman, Moshe Tennenholtz