Question

Use the “Golden Rules of probability distributions” to prove that all coordination games have a mixed strategy Nash equilibrium.

Answer 1

A mixed Nash equilibrium includes at any rate one player playing a randomized methodology and no player having the option to expand their normal result by playing a substitute system. A Nash equilibrium wherein no player randomizes is known as a pure strategy Nash balance

A mixed Nash equilibrium includes at any rate one player playing a randomized methodology and no player having the option to build their normal result by playing a substitute procedure.

Processing a mixed technique has one component that regularly seems befuddling. Assume that Row will randomize. At that point Row's settlements must be equivalent for all methodologies that Row plays with positive likelihood. In any case, that balance in Row's settlements doesn't decide the probabilities with which Row plays the different lines. Rather, that correspondence in Row's settlements will decide the probabilities with which Column plays the different sections. The explanation is that it is Column's probabilities that decide the normal adjustments for Row; in the event that Row will randomize, at that point Column's probabilities must be with the end goal that Row is happy to randomize.