39 search results - page 1 / 8 » Solving Probabilistic Combinatorial Games |
ACG
2006
Springer
13 years 10 months ago
2006
Springer
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
CAV
2010
Springer
13 years 7 months ago
2010
Springer
Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with -regular objectives; and (b) synthesizes reasonable environment assumptions f...
ANTSW
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...