1410 search results - page 186 / 282 » The Algorithmics of Solitaire-Like Games |
137
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we study the use of experts algorithms in a multiagent setting. In this paper we allow agents to use multiple experts and explore different experts algorithms that a...
149
Voted
AAAI
2007
15 years 5 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
93
Voted
AAAI
2000
15 years 4 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
175
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
The goal of this project is to develop an agent capable of learning and behaving autonomously and making decisions quickly in a dynamic environment. The agent’s environment is a...
131
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
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...