1410 search results - page 139 / 282 » The Algorithmics of Solitaire-Like Games |
PAAMS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
83
Voted
ATAL
2010
Springer
15 years 22 days ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
ICML
2003
IEEE
16 years 13 days ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
91
Voted
COLT
2004
Springer
15 years 5 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
105
Voted
IJCAI
2001
15 years 1 months ago
2001
This paper investigates the problem of policy learning in multiagent environments using the stochastic game framework, which we briefly overview. We introduce two properties as de...