25 search results - page 4 / 5 » Algorithms for Omega-Regular Games with Imperfect Informatio... |
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be b...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
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...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
CONCUR
2009
Springer
14 years 6 days ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
AAAI
2012
11 years 8 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...