Sciweavers

56 search results - page 8 / 12
» Strategy Construction for Parity Games with Imperfect Inform...
Sort
View
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 9 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
ICC
2009
IEEE
127views Communications» more  ICC 2009»
14 years 2 months ago
Security Games with Incomplete Information
—We study two-player security games which can be viewed as sequences of nonzero-sum matrix games where at each stage of the iterations the players make imperfect observations of ...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
ATAL
2010
Springer
13 years 8 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
ATAL
2008
Springer
13 years 9 months ago
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding progr
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...
CONCUR
2009
Springer
14 years 2 months ago
Compositional Control Synthesis for Partially Observable Systems
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
Wouter Kuijper, Jaco van de Pol