83 search results - page 3 / 17 » Optimization of a Billiard Player - Tactical Play |
NIPS
2001
13 years 7 months ago
2001
We propose a new classification for multi-agent learning algorithms, with each league of players characterized by both their possible strategies and possible beliefs. Using this c...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
FORMATS
2005
Springer
13 years 12 months ago
2005
Springer
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
Abstract—We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. At each time, a player chooses K out of N (N > K) arms to play. The state of each ar...
ML
1998
ACM
13 years 6 months ago
1998
ACM
Game playing has been a popular problem area for research in artificial intelligence and machine learning for many years. In almost every study of game playing and machine learnin...