Sciweavers

627 search results - page 4 / 126
» Efficient On-the-Fly Algorithms for the Analysis of Timed Ga...
Sort
View
FORMATS
2008
Springer
13 years 8 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
13 years 8 months ago
Precise Interval Analysis vs. Parity Games
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...
Thomas Gawlitza, Helmut Seidl
ATAL
2010
Springer
13 years 7 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
CG
2008
Springer
13 years 8 months ago
An Analysis of UCT in Multi-player Games
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an ...
Nathan R. Sturtevant
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
13 years 11 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger