Sciweavers

3 search results - page 1 / 1
» How to Explore your Opponent's Strategy (almost) Optimally
Sort
View
ICMAS
1998
13 years 6 months ago
How to Explore your Opponent's Strategy (almost) Optimally
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...
David Carmel, Shaul Markovitch
GECCO
2008
Springer
167views Optimization» more  GECCO 2008»
13 years 5 months ago
Using coevolution to understand and validate game balance in continuous games
We attack the problem of game balancing by using a coevolutionary algorithm to explore the space of possible game strategies and counter strategies. We define balanced games as g...
Ryan E. Leigh, Justin Schonfeld, Sushil J. Louis
ML
1998
ACM
148views Machine Learning» more  ML 1998»
13 years 4 months ago
Colearning in Differential Games
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...
John W. Sheppard