Find the Nash equilibrium(s) of each of the following games. Show your work, including how you determined the best responses.

	Player B
Player A		U	D
	U			3			4
		3			1
	D			1			0
		4			0

	Player B
Player A		U	D
	U			3			7
		3			1
	D			1			5
		7			5

Sometimes, sequential-move games and simultaneous move games give different results. This question illustrates this idea.

Find all the Nash equilibriums for the following simultaneous move game. Show your work, including how you determined the best responses.

	Player B
Player A		L	R
	L			2			0
		2			3
	R			3			4
		0			4

Now, suppose we let Player A play first, and let Player B observe their action before playing. Explain why the following game tree describes this situation. (Player As payoffs are listed first in each ordered pair.)

Working from the bottom of the tree upwards, compute the equilibrium for the sequential version of the game. Show your work, including how you determined the best responses.

Is it a good idea to have a player play first in this game? Why or why not?