Sciweavers

294 search results - page 8 / 59
» The complexity of computing a Nash equilibrium
Sort
View

Presentation
1554views
17 years 2 months ago
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources, Poster Presentation at Microsoft TechVista Delhi. (October 2007)
Sujit Gujar, Rama Suri Narayanam, Y Narahari
126
Voted
IJCAI
2007
15 years 4 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
128
Voted
ATAL
2009
Springer
15 years 10 months ago
Multiagent reinforcement learning: algorithm converging to Nash equilibrium in general-sum discounted stochastic games
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
Natalia Akchurina