Sciweavers

115 search results - page 3 / 23
» Finding Optimal Abstract Strategies in Extensive-Form Games
Sort
View
JUCS
2010
160views more  JUCS 2010»
13 years 2 months ago
How Incomputable is Finding Nash Equilibria?
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
Arno Pauly
KES
2004
Springer
14 years 1 months ago
Using Evolution Strategies to Find a Dynamical Model of the M81 Triplet
Abstract. In this work we present Evolution Strategies (ES) as an efficient optimization method for dynamic modelling of the main interact
Juan Carlos Gomez, Olac Fuentes, Lia Athanassoula,...
CONCUR
2005
Springer
14 years 1 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
IJCAI
2003
13 years 9 months ago
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
Darse Billings, Neil Burch, Aaron Davidson, Robert...
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 1 months ago
Dynamic Strategies in a Real-Time Strategy Game
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
William Joseph Falke II, Peter Ross