1306 search results - page 7 / 262 » Strategy Acquisition for the Game |
103
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Abstract. This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to...
205
click to vote
ICGA
2006
17 years 25 days ago
2006
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
102
Voted
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
69
Voted
CG
2002
Springer
15 years 16 days ago
2002
Springer
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...
109
Voted
RE
2001
Springer
15 years 5 months ago
2001
Springer
This paper argues that there are new insights to be gained from a strategic analysis of requirements engineering. The paper is motivated by a simple question: what does it take to...