5 search results - page 1 / 1 » Strategy generation in multi-agent imperfect-information pur... |
AAAI
1998
13 years 6 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
We describe a formalism and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team, called tr...
AAAI
1996
13 years 6 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
ATAL
2008
Springer
13 years 6 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 8 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...