From "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" by David Easley and Jon Kleinberg Exercises 6.11, Problem 9

9. For each of the following two player games find all Nash equilibria. In each payoff matrix below the rows correspond to player A's strategies and the columns correspond to player B's strategies. The first entry in each box is player A's payoff and the second entry is player B's payoff 204 CHAPTER 6. GAMES Player B L R U 8,4 5.5 D 3,34,8 Player B Player A lar 00-1.1 U 0,011 1,1 2. 2