output
20022013
most citedIndication of Electron Neutrino Appearance from an Accelerator-produced Off-axis Muon Neutrino Beam

1.4k citations

Showing cs.GTShow all

10 papers · 1 filter

cs.GT20126 cited

Playing Pushdown Parity Games in a Hurry

Wladimir Fridman, Martin Zimmermann

We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones.…

cs.GT20111 cited

Optimal Bounds in Parametric LTL Games

Martin Zimmermann

We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bound…

cs.GT20111 cited

Connectivity Games over Dynamic Networks

Sten Grüner, Frank G. Radmacher, Wolfgang Thomas

A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoratio…

cs.GT20115 cited

Memory Reduction via Delayed Simulation

Marcus Gelderie, Michael Holtmann

We address a central (and classical) issue in the theory of infinite games: the reduction of the memory size that is needed to implement winning strategies in regular infinite game…

cs.GT2010

Considerate Equilibrium

Martin Hoefer, Michal Penn, Maria Polukarov +2

We consider the existence and computational complexity of coalitional stability concepts based on social networks. Our concepts represent a natural and rich combinatorial generaliz…

cs.GT20102 cited

Formats of Winning Strategies for Six Types of Pushdown Games

Wladimir Fridman

The solution of parity games over pushdown graphs (Walukiewicz '96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for…