Sciweavers

533 search results - page 45 / 107
» Playing games with approximation algorithms
Sort
View
TCS
2008
13 years 7 months ago
The Magnus-Derek game
We introduce a new combinatorial game between two players: Magnus and Derek. Initially, a token is placed at position 0 on a round table with n positions. In each round of the gam...
Zhivko Prodanov Nedev, S. Muthukrishnan
NIPS
2003
13 years 9 months ago
Learning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
GAMEON
2000
13 years 9 months ago
Real Time Goal Orientated Behaviour for Computer Game Agents
To increase the depth and appeal of computer games, the intelligence of the characters they contain needs to be increased. These characters should be played by intelligent agents ...
Nick Hawes
CIG
2006
IEEE
13 years 9 months ago
Improving Artificial Intelligence In a Motocross Game
We have previously investigated the use of artificial neural networks to ride simulated motorbikes in a new computer game. These artificial neural networks were trained using two d...
Benoit Chaperot, Colin Fyfe
ATAL
2011
Springer
12 years 7 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...