  Here we present a decomposition technique for a class of differential games.
The technique consists in a decomposition of the target set which produces, for
geometrical reasons, a decomposition in the dimensionality of the problem.
Using some elements of Hamilton-Jacobi equations theory, we find a relation
between the regularity of the solution and the possibility to decompose the
problem. We use this technique to solve a pursuit evasion game with multiple
agents.
