Bounding Average-Energy Games

Landau Institute for Theoretical Physics RAS, Chernogolovka, Moscow region, Russia; Moscow State University, Moscow, Russia; Moscow Physical-Technical Institute, Dolgoprudny,

Physically, this means that at energies of this order pions (which are the lightest hadrons) can be produced in collisions of protons in cosmic rays with CMB photons, which prevents

Being more sensitive than the variational methods to any local perturbation of the trial function, this method can used to systematically improve the energy bounds with a local

Existence of bounds for reachability games The case of energy-reachability is trivial: as soon as there exists a winning strategy for L-energy-reachability, the maximal energy

If the number of points to test, denoted N , is large enough e.g., 1000 or larger, there exists a faster method, using the fact that the set SI is generally empty: we can look for

Then, we identify a class of weighted timed games, that we call robust, for which this reduction to the cycle forming game on the region graph is complete: in this case the good

/ La version de cette publication peut être l’une des suivantes : la version prépublication de l’auteur, la version acceptée du manuscrit ou la version de l’éditeur. For

Observe that if U is encoded in unary or if U is polynomial in the size of the original game, the complexity of the AE LU problem collapses to NP ∩ coNP for two-player games and to