Sciweavers

356 search results - page 28 / 72
» Graph Games on Ordinals
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 4 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
WINE
2009
Springer
83views Economy» more  WINE 2009»
15 years 4 months ago
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...
ESA
2005
Springer
76views Algorithms» more  ESA 2005»
15 years 3 months ago
The Complexity of Games on Highly Regular Graphs
Konstantinos Daskalakis, Christos H. Papadimitriou