44 search results - page 8 / 9 » The Complexity of Winning Strategies in Infinite Games |
FM
2008
Springer
13 years 7 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is no...
WG
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
FOIKS
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...