Sciweavers

12519 search results - page 2442 / 2504
» Approximation Problems Categories
Sort
View
ATAL
2010
Springer
15 years 5 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
132
Voted
ATAL
2010
Springer
15 years 5 months ago
Linear options
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
Jonathan Sorg, Satinder P. Singh
ATAL
2010
Springer
15 years 5 months ago
Collective decision-making in multi-agent systems by implicit leadership
Coordination within decentralized agent groups frequently requires reaching global consensus, but typical hierarchical approaches to reaching such decisions can be complex, slow, ...
Chih-Han Yu, Justin Werfel, Radhika Nagpal
ATAL
2010
Springer
15 years 5 months ago
Distributed multiagent learning with a broadcast adaptive subgradient method
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
Renato L. G. Cavalcante, Alex Rogers, Nicholas R. ...
ATAL
2010
Springer
15 years 5 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
« Prev « First page 2442 / 2504 Last » Next »