Sciweavers

356 search results - page 7 / 72
» Graph Games on Ordinals
Sort
View
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 9 months ago
Digraph Decompositions and Monotonicity in Digraph Searching
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
Stephan Kreutzer, Sebastian Ordyniak
89
Voted
TAMC
2010
Springer
15 years 2 months ago
The Max k-Cut Game and Its Strong Equilibria
An instance of the max k−cut game is an edge weighted graph. Every
Laurent Gourvès, Jérôme Monnot
73
Voted
VMCAI
2009
Springer
15 years 4 months ago
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
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...
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
FOSSACS
2008
Springer
14 years 11 months ago
Stochastic Games with Lossy Channels
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLC...
Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Al...
FOSSACS
2006
Springer
15 years 1 months ago
Parity Games Played on Transition Graphs of One-Counter Processes
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
Olivier Serre