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?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.