Design the payoffff matrix of a game with no Nash Equilibria. The game should have 2 players, 2 strategies for each player, and the payoffffs for each player should be either 0 or 1.

find all Nash equilibria in this game using von  Neumann-Morgenstern preferences:

Game Theory Consider the entry game with incomplete information studied in class. An incumbent politician's cost of campaigning can be high or low and the entrant does not know this cost (but the incumbent does). In class, we found two pure-strategy Bayesian Nash Equilibria in this game. Assume that the probability that the cost of campaigning is high is a parameter p, 0 < p < 1. Show that when p is large enough, there is only one pure-strategy Bayesian Nash Equilibrium. What is it? What is the intuition? How large does p have to be? Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.

find all Nash equilibria in this game using von  Neumann-Morgenstern preferences: