Curvature being one of the fundamental notions in classical geometry, there has been great interest in extending it to discrete objects such as graphs. There are now multiple definitions of curvature on graphs (combinatorial, via the Laplacian, via Optimal Transport). We describe some of the ideas that underlie these definitions and also propose a new curvature: what is particularly appealing is that it's very easy to compute and has ties with the von Neumann Minimax Theorem from Game Theory. There will be many colorful pictures and several fascinating open problems.