Sciweavers

1997 search results - page 53 / 400
» On the convergence of Hill's method
Sort
View
ATAL
2008
Springer
15 years 8 months 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
DAGSTUHL
2007
15 years 7 months ago
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
Dario Andrea Bini, Bruno Iannazzo, Beatrice Meini,...
JMLR
2010
115views more  JMLR 2010»
15 years 4 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
AI
2007
Springer
16 years 10 days ago
Competition and Coordination in Stochastic Games
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
Andriy Burkov, Abdeslam Boularias, Brahim Chaib-dr...
NIPS
2003
15 years 7 months ago
Extending Q-Learning to General Adaptive Multi-Agent Systems
Recent multi-agent extensions of Q-Learning require knowledge of other agents’ payoffs and Q-functions, and assume game-theoretic play at all times by all other agents. This pap...
Gerald Tesauro