Sciweavers

83 search results - page 6 / 17
» Optimization of a Billiard Player - Tactical Play
Sort
View
IJCAI
2003
14 years 11 months ago
Learning Minesweeper with Multirelational Learning
Minesweeper is a one-person game which looks deceptively easy to play, but where average human performance is far from optimal. Playing the game requires logical, arithmetic and p...
Lourdes Peña Castillo, Stefan Wrobel
DAM
2006
59views more  DAM 2006»
14 years 10 months ago
Optimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, ) dice game, two players can independently choose a dice from a collection...
Bart De Schuymer, Hans De Meyer, Bernard De Baets
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 10 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu
CORR
2010
Springer
187views Education» more  CORR 2010»
14 years 10 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao