Dynamic programming uses backward induction as a main method for solving the Bellman equation. In #game theory, backward induction is mainly used to compute subgame perfect equilibira in #sequential game.
