We study best response dynamics in continuous time for continuous concave-convex zero-sum games and prove convergence of its trajectories to the set of saddle points, thus providing a dynamical proof of the minmax theorem. Consequences for the corresponding discrete time process with small or diminishing step-sizes are established, including convergence of the fictitious play procedure.
Stored only when both papers are in the corpus — 94 citations exist upstream.