Sciweavers

533 search results - page 8 / 107
» Playing games with approximation algorithms
Sort
View
AAAI
2006
13 years 9 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
SGAI
2009
Springer
14 years 2 months ago
Explaining How to Play Real-Time Strategy Games
Real-time strategy games share many aspects with real situations in domains such as battle planning, air traffic control, and emergency response team management which makes them a...
Ronald A. Metoyer, Simone Stumpf, Christoph Neuman...
ATAL
2008
Springer
13 years 9 months ago
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde,...
ICRA
2007
IEEE
128views Robotics» more  ICRA 2007»
14 years 1 months ago
Adaptive Play Q-Learning with Initial Heuristic Approximation
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
Andriy Burkov, Brahim Chaib-draa
BIRTHDAY
2008
Springer
13 years 9 months ago
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....
Wolfgang Reisig