Sciweavers

214 search results - page 5 / 43
» Finding Optimal Strategies for Imperfect Information Games
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 1 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
69
Voted
CG
2002
Springer
15 years 4 days ago
Learning a Game Strategy Using Pattern-Weights and Self-play
Abstract. This paper demonstrates the use of pattern-weights in order to develop a strategy for an automated player of a non-cooperative version of the game of Diplomacy. Diplomacy...
Ari Shapiro, Gil Fuchs, Robert Levinson
AIIDE
2009
15 years 1 months ago
Case-Based Reasoning for Build Order in Real-Time Strategy Games
We present a case-based reasoning technique for selecting build orders in a real-time strategy game. The case retrieval process generalizes features of the game state and selects ...
Ben George Weber, Michael Mateas
AAAI
2012
13 years 2 months ago
Finding Optimal Abstract Strategies in Extensive-Form Games
Michael Johanson, Nolan Bard, Neil Burch, Michael ...
ATAL
2008
Springer
15 years 2 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...