How do you prove that minimax algorithm outputs a subgame-perfect Nash equilibrium?


At every node, MAX would always move to maximise the minimum payoff while MIN choose to minimise the maximum payoff, hence there is nash equilibrium.

By using backwards induction, at every node, MAX and MIN player would act optimally. Hence, there is subperfect nash equilibrium.

How do I formally prove this?


Posted 2020-05-28T14:56:25.563

Reputation: 33

Have you looked at this article

– nbro – 2020-05-29T18:41:47.243

No answers