Sciweavers

56 search results - page 5 / 12
» Strategy Construction for Parity Games with Imperfect Inform...
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 9 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...
CG
2002
Springer
13 years 7 months 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
13 years 8 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
CAV
2009
Springer
168views Hardware» more  CAV 2009»
14 years 2 months ago
Games through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
Thomas Gawlitza, Helmut Seidl
COCOON
2007
Springer
14 years 1 months ago
Finding Equilibria in Games of No Chance
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...