344 search results - page 3 / 69 » Banach-Mazur Games on Graphs |
TAMC
2010
Springer
14 years 15 days ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
WG
2009
Springer
14 years 2 months 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...
CAV
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
FUN
2010
Springer
14 years 7 days ago
2010
Springer
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...