Sciweavers

85 search results - page 2 / 17
» Applications of approximation algorithms to cooperative game...
Sort
View
ATAL
2007
Springer
15 years 3 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
77
Voted
FLAIRS
2009
14 years 7 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
AGI
2011
14 years 1 months ago
Multigame Playing by Means of UCT Enhanced with Automatically Generated Evaluation Functions
General Game Playing (GGP) contest provides a research framework suitable for developing and testing AGI approaches in game domain. In this paper, we propose a new modification of...
Karol Waledzik, Jacek Mandziuk
88
Voted
ATAL
2008
Springer
14 years 11 months ago
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
Matthijs T. J. Spaan, Francisco S. Melo
108
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
Non-Cooperative Power Control for Faded Wireless Ad Hoc Networks
— The problem of non-cooperative power control is studied for wireless ad hoc networks supporting data services. We develop a maximum throughput based non-cooperative power contr...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng