Sciweavers

601 search results - page 1 / 121
» Playing large games using simple strategies
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
CIG
2006
IEEE
13 years 10 months ago
Evolving Adaptive Play for the Game of Spoof Using Genetic Programming
Abstract— Many games require opponent modelling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to d...
Mark Wittkamp, Luigi Barone
CONCUR
2005
Springer
13 years 10 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
13 years 10 months ago
Evolving explicit opponent models in game playing
Opponent models are necessary in games where the game state is only partially known to the player, since the player must infer the state of the game based on the opponent’s acti...
Alan J. Lockett, Charles L. Chen, Risto Miikkulain...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 8 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar