2.3 Game theory Flashcards
What is game theory?
Game theory is the study of strategic interaction
What is a game?
A game consists of 3 things:
• Players e.g. firms
• Strategies i.e. ‘plans of action’ (not the same as actions)
• Payoffs e.g. profits that depend on strategies of all players
Today will we look at only one shot( static) games?
No we will use look at repeated games
What 2 types of games are we going to look at and do they give the same result?
simultaneous game or sequential game, and we can get very different results.
Tell me what the players, strategies and payoffs are ?
The players are firms 1 and 2
The players’ strategies are large output or small output
The payoff for each player depends on the choice of strategy by all players.
What is a dominant strategy?
a dominant strategy is the course of action that results in the highest payoff for a player regardless of what the other player does.
What is a dominated strategy?
A strategy is dominated if there always exist a course of action which results in higher payoff no matter what the opponent does.
Is there a dominant strategy here?
Yes playing large for both players is a dominant strategy.
What is a Nash equilibrium?
The Nash Equilibrium (NE) of the game is the set of strategies that are best responses to each other.
What is the Nash equilbrium of this game ( what are the set of strategies and payoff’s?
The NE outcome: (large, large)
What payoffs do the players get in
this outcome? (16, 16)
Can both firms do better? what would they have to do to get this payoff? Is it a Nash equilibrium, is there incentive to deviate?
Yes ( 18,18) ( small,small)
This will involve them colluding to get this payoff but the problem of this payoff is that there is an incentive to deviate ( cheat), thats why collusion is inherently unstable.
What does best response mean?
A best response for player k is a strategy that maximises k’s payoff, given the strategies of the other players.
What does best response mean?
A best response for player k is a strategy that maximises k’s payoff, given the strategies of the other players.
What type of game is this?
In the Prisoner’s Dilemma, the outcome when both players act in their
individual interest is worse for both of them than if they act cooperatively.
If the 2 firms cooperate there is an incentive to cheat, hence explains why cartels are difficult to sustain.
What can we think this as a model of and what does it mean if the 2 firms collaborate (what does it do to their profits?
Think of this as a model of a cartel with two firms
• Limiting production (small, small) increases profits for all firms – firms act
jointly as a monopolist to maximise industry profits
Is there a Pure strategy Nash Equilibrium in this game and explain the strategies of each player? ( -100 is a fine, -5 is the wasted effort he exerts when he patrols and the driver parks legally, -10 is the effort of the driver to park legally, 0 is he parks illegally he doesn’t get anything if the warden doesn’t patrol.
No they isn’t a Pure strategy Nash equilibrium.
If the warden patrols the driver parks legally
If the warden does not patrol the driver parks illegally
If the driver parks legally the warden does not patrol
If the driver parks illegally the warden patrols
What is the difference between a pure strategy and a mixed strategy using this game as an example?
A player plays a pure strategy if he or she does not randomize, e.g. patrols
or does not patrol.
A player plays a mixed strategy if he or she randomizes, e.g. patrols with
probability “ 1/3 and does not patrol with probability 2/3.
Be careful if the question says to find nash equilibrium, what does that mean?
This asks you to find all the pure strategies and mixed strategies nash equilibrium.
When finding Mixed strategy Nash equilibrium, for player 1 ( row player, we calculate mixed strategies how) and what about player 2( column player
We assign probabilities to each player
1) for the row player( player 1 we use the 1st numbers in a payoff matrix of each row, using the algebraic probabilities corresponding on top of player 2)
2for the column player ( player 2 we use the 2nd number in the payoff matrix but in the downward column, using the algebraic probabilities of player 1)
Find the mixed strategy Nash equilibrium of this game and what is the calculation essentially saying?
The expected payoff from patrolling = the expected payoff of not patrolling
The expected payoff from parking legally = the E(P) from parking illegally.
If they didn’t equal it would be a pure strategy nash equilibrium.
Lets interpret this, what can we say about the reward of patrolling and finding the driver park illegally and punishment for the car driver patrolling illegally?
If the reward (15) for catching the driver park illegally goes up, the traffic warden more likely to patrol.
If the fine goes up then the traffic warden will patrol less frequently as the fine is huge, meaning drivers less likely to park illegally.
Can games have multiple equibria and what does this mean?
Yes they can and this means that game theory cannot always predict an outcome.
Find all the nash equibria for this game and what type of game is this( can we predict whats going to happen) , what does the biologist prefer and what does the economist prefer?
Two NE in pure strategies: (Mac, Mac) and (PC, PC)
• Coordination game(t describes the situation where a player will earn a higher payoff when he selects the same course of action as another player.)( we cannot predict whats going to happen)
Biologist prefers Mac and the Economists prefers the PC.
Just for reminder what is a simultaneous game?
players choose their strategies simultaneously( same time) and we used payoffs payoff matrix to illustrate the game.
Now we will look at a sequential move game ( extensive form game) what is this and give an example?
Is a way of describing a game using a game tree, it is a diagram that shows what choices are made at different points of time ( sequential, not simultaneously( same time) . This is response that siultaneous games have multiple equibria so we cannot tell what is the best outcome.
Chess is an example of a sequential game.
Is there perfect information with a sequential game ( what about simultaneous games) ?
information is perfect since each player can see the decision taken by the previous player, ( for simultaneous games, there isn’t perfect information)
We are now going to look at examples of sequential games to build. Looking at a 2 stage game.
We have 2 players, player 1 and player 2, each players will be able to choose strategies, which are strategy 1 and 2? Build the game tree and highliglight some key terminology.
1) Player 1 has to made a decision first and this is represented by a decision node ( black dot). He can pick 2 strategies ( A and B)
2) 2 new nods are drawn for player 2 ( player 2 knows the strategy of player 1, so he can pick his strategies based on player 1 picking his strategy )
3) So if player 1 picks strategy A, player 2 would have to pick strategy A or B and same thing if player 1 picks strategy B)
4) We would have payoffs at the end.
Lets look at another example of an extensive form game?
( The game has 2 stages)
Stage 1: Potential entrant chooses whether to enter
Stage 2: incumbent chooses whether to fight
Draw a game tree?
Don’t worry about the payoffs yet.( but what player does each payoff correspond to?)
Player 1 = Potential entrant
Player 2 incumbent
( The first payoff corresponds to player 1 and the second player 2)
Draw a game tree for this