Résumé en anglais

This chapter deals with theoretical and numerical results for solving qualitative and quantitative control and differential game problems. These questions are treated in the framework of set-valued analysis and viability theory. In a way, this approach is rather well adapted to look at these several problems with a unified point of view. The idea is to characterize the value function as a viability kernel instead of solving a Hamilton—Jacobi—Bellmann equation. This allows us to easily take into account state constraints without any controllability assumptions on the dynamic, neither at the boundary of targets, nor at the boundary of the constraint set. In the case of two-player differential games, the value function is characterized as a discriminating kernel. This allows dealing with a large class of systems with minimal regularity and convexity assumptions. Rigorous proofs of the convergence, including irregular cases, and completely explicit algorithms are provided.