1410 search results - page 39 / 282 » The Algorithmics of Solitaire-Like Games |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
106
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
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...
ICANN
2005
Springer
15 years 4 months ago
2005
Springer
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
SIGECOM
2009
ACM
15 years 5 months ago
2009
ACM
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...