Sciweavers

601 search results - page 16 / 121
» Playing large games using simple strategies
Sort
View
AIIDE
2007
15 years 8 months ago
Automatic Design of Balanced Board Games
AI techniques are already widely used in game software to provide computer-controlled opponents for human players. However, game design is a more-challenging problem than game pla...
Joe Marks, Vincent Hom
FORMATS
2005
Springer
15 years 11 months ago
Average Reward Timed Games
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 ...
B. Thomas Adler, Luca de Alfaro, Marco Faella
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
16 years 22 days ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
NIPS
2007
15 years 7 months ago
Computing Robust Counter-Strategies
Adaptation to other initially unknown agents often requires computing an effective counter-strategy. In the Bayesian paradigm, one must find a good counterstrategy to the inferre...
Michael Johanson, Martin Zinkevich, Michael H. Bow...
CIG
2005
IEEE
15 years 11 months ago
A Generic Approach for Generating Interesting Interactive Pac-Man Opponents
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
Georgios N. Yannakakis, John Hallam