344 search results - page 43 / 69 » Banach-Mazur Games on Graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
AAAI
1996
14 years 11 months ago
1996
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
130
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
VMCAI
2010
Springer
15 years 7 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...