66 In two-player games with finite actions, one way to present game is payoff matrix -1, -1-10, 0 0, -10-5, -5 MumRat Mum Rat Player 2's Action Player 1's Action Player 1's PayoffPlayer 2's Payoff Always Player 1
{"Image DocumentName": "Nash Equilibrium We solve a game by looking for a Nash equilibrium", "Image ImageDescription": "Nash equilibrium is a strategy profile (an action for each player) such that: No player can improve his payoff by switching to a different action\u2026 \u2026given what his opponent/opponents are doing. In most games, players won\u2019t have a single move that\u2019s always best. Best move will sometimes depend on what other player (or players) is doing. We solve a game by looking for a Nash equilibrium. Nash equilibrium is a strategy profile (an action for each player) such that no one player can do better by switching to a different action (given what everyone else is doing) So playing Mum is never part of an equilibrium. Whatever your opponent is doing, you could improve by switching to Rat", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}