Sciweavers

533 search results - page 31 / 107
» Playing games with approximation algorithms
Sort
View
COR
2008
142views more  COR 2008»
13 years 7 months ago
Application of reinforcement learning to the game of Othello
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...
Nees Jan van Eck, Michiel C. van Wezel
WINE
2007
Springer
166views Economy» more  WINE 2007»
14 years 1 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 8 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 2 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
13 years 2 months ago
Using computer games for hybrid systems controller synthesis
Abstract-- We propose a formal method for feedback controller synthesis using interactive computer programs with graphical interface (in short, computer games). The main theoretica...
A. Agung Julius, Sina Afshari