Sciweavers

50 search results - page 1 / 10
» Nash Convergence of Gradient Dynamics in General-Sum Games
Sort
View
UAI
2000
14 years 3 days ago
Nash Convergence of Gradient Dynamics in General-Sum Games
Multi-agent games are becoming an increasingly prevalent formalism for the study of electronic commerceand auctions. The speed at which transactions can take place and the growing...
Satinder P. Singh, Michael J. Kearns, Yishay Manso...
ICML
2000
IEEE
14 years 11 months ago
Convergence Problems of General-Sum Multiagent Reinforcement Learning
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
Michael H. Bowling
ATAL
2008
Springer
14 years 23 days ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman
ICML
2001
IEEE
14 years 11 months ago
Convergence of Gradient Dynamics with a Variable Learning Rate
As multiagent environments become more prevalent we need to understand how this changes the agent-based paradigm. One aspect that is heavily affected by the presence of multiple a...
Michael H. Bowling, Manuela M. Veloso
CDC
2010
IEEE
104views Control Systems» more  CDC 2010»
13 years 5 months ago
Single timescale regularized stochastic approximation schemes for monotone Nash games under uncertainty
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
Jayash Koshal, Angelia Nedic, Uday V. Shanbhag