2.3 Game theory Flashcards

1
Q

What is game theory?

A

Game theory is the study of strategic interaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a game?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Today will we look at only one shot( static) games?

A

No we will use look at repeated games

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What 2 types of games are we going to look at and do they give the same result?

A

simultaneous game or sequential game, and we can get very different results.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Tell me what the players, strategies and payoffs are ?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a dominant strategy?

A

a dominant strategy is the course of action that results in the highest payoff for a player regardless of what the other player does.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a dominated strategy?

A

A strategy is dominated if there always exist a course of action which results in higher payoff no matter what the opponent does.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Is there a dominant strategy here?

A

Yes playing large for both players is a dominant strategy.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a Nash equilibrium?

A

The Nash Equilibrium (NE) of the game is the set of strategies that are best responses to each other.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the Nash equilbrium of this game ( what are the set of strategies and payoff’s?

A

The NE outcome: (large, large)
What payoffs do the players get in
this outcome? (16, 16)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does best response mean?

A

A best response for player k is a strategy that maximises k’s payoff, given the strategies of the other players.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What does best response mean?

A

A best response for player k is a strategy that maximises k’s payoff, given the strategies of the other players.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What type of game is this?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

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?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

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.

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What is the difference between a pure strategy and a mixed strategy using this game as an example?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Be careful if the question says to find nash equilibrium, what does that mean?

A

This asks you to find all the pure strategies and mixed strategies nash equilibrium.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

When finding Mixed strategy Nash equilibrium, for player 1 ( row player, we calculate mixed strategies how) and what about player 2( column player

A

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)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Find the mixed strategy Nash equilibrium of this game and what is the calculation essentially saying?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

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?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Can games have multiple equibria and what does this mean?

A

Yes they can and this means that game theory cannot always predict an outcome.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

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?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Just for reminder what is a simultaneous game?

A

players choose their strategies simultaneously( same time) and we used payoffs payoff matrix to illustrate the game.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Now we will look at a sequential move game ( extensive form game) what is this and give an example?

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

Is there perfect information with a sequential game ( what about simultaneous games) ?

A

information is perfect since each player can see the decision taken by the previous player, ( for simultaneous games, there isn’t perfect information)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

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.

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

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?)

A

Player 1 = Potential entrant
Player 2 incumbent
( The first payoff corresponds to player 1 and the second player 2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Draw a game tree for this

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Draw the tree diagram for this payoff matrix? ( why cant we use this to find sub game perfect equilibrium?

A

Because there is no perfect information for simultaneous games.

31
Q

How do we analyse a sequential move game?

A

Using Backward induction ( we start at the last move of the game, then proceed to the second to last move of the game

32
Q

What are the steps to find sub game Perfect equibirum?

A

1) We look at each sub game using ( at the last stage. in this example its stage 2, where there are 2 subgames)
2) First sub game if you are the incumbent and you know the potential entrant has entered, you choose whether to fight or not fight, the best thing to do is not fight as 1>0. ( remember the second payoff is responds to player 2)
3) Then we look at the second sub game. we know that the potential entrant hasn’t entered so the incumbement again can choose to fight or not fight. The best thing to do here is not clear as they are indifferent. Thus we are down to 3 potential choices.
4) Now we look at the perspective of player 1 ( potential entrant), looking forward you know if you enter and the incumbent wants to fight you will not want to do that as the payoff is 0.
5) Now the optimal we look at the 3 choices we have left and we see entering not fight is optimal as he gets a payoff of 1 which is greater than >00.

33
Q

What equilibrium are we trying to find and what does it mean?

A

We are trying to find a Subgame perfect equilibrium( SPE) a set of strategies which consistutes a NE in every subgame ( no one has the incentive to deviate(best response))

34
Q

Represent the subgame perfect equilibrium

and the payoffs from SPE

A

In the bracket you put choose of action first from player 1, then put the 3 options which were left down to we write it in a backward way)
Subgame Perfect Equilibrium: (E; NF | E, F | NE, NF | NE)
Payoffs from SPE: (1, 1)

35
Q

Find the Subgame perfect equilibrium ( explain in your head)

A

( D; R | D, L | U)

Payoffs from SPE: (3,1)

36
Q

In a simultaneous game what would be the pure strategy nash equibria as supposed to the sequential move entry game?

A

Simultaneous move entry game: two pure strategy Nash equilibria
(Not enter, Fight) and (Enter, Not fight).
• Sequential move entry game: one equilibrium outcome (Enter, Not fight).

37
Q

What is credible threat and a non credible threat

A

t

38
Q

What is the credible threat in this game?

A

T

39
Q

How can we make a threat more credible?

A
40
Q

We are now going to look at if we repeated a game, would it change the outcome? What are the 2 ways a game can be repeated and how do we solve them?

A

• Finitely repeated games: solve using backwards induction ( e.g. repeated 50 finite times)
• Infinitely repeated games: maximize the present discounted value of pay-offs
We are going to use the collusion game to do this.

41
Q

Collusion game: IF two firms are to collude, what do they have to behave like?

A

A monopolist, so they find the monopolist profit then divide by how many firms there are. Monopolist can set the price and quantity( so we need to find out what that would be first of all?

42
Q

Assuming all of this, find the monopoly profit in the market and the price they would set and quantity to make profit

A

1) Set out the profit equation TR - TC/ or ( P-MC/C)Q
p =10 - Q
( 10-Q-2)Q = (8-Q)Q = 8Q-Q^2
2) Firms wants to maxmise profit so we differentiate the profit function and set it 0( we also find SOC to confirm its a maximum ( if its negative its a maximum)
3) 8-2Q=0 —- Q^m = 4
P = 10-4 = 6
We now know that monopoly profit = 16 ( P-MC/C)X Q = (6-2)4 = 16.

They both set price of 6 and share profits, so each firms profit from collusion is 8

43
Q

Collusion game: Now we need to think whether the firms have an incentive to deviate and cheat, so what do we need to do and solve it?
( Suppose a firm can cheat by undercutting price by £1 and gets all the market, while the other stays faithful and sets the monopoly price) find the profits of the player that cheats and the player that doesn’t?

A

We know that the new price = £5 that means P=10-Q, where Q = q1 + q2, 5 = 10-p =
Q = 10-5=5
Q is now the quantity of the market so q1 = Q
Profit for the firm that cheats is ( P-MC/C)XQ = (5-2)5 = 15 or use this equation 8Q-Q^2 = 40-25= 15
Profit for the firm that doesn’t cheat = 0. ( doesn’t get any of the profit because products are identical.)

If both cheat they still set price 5, but Q=5, Is divided by 5 ( quantity demanded by market.)
So ( 5-2)2.5 = 7.5

44
Q

Summarise the payoffs of this collusion game?

A

If they both collude they will set a price of 6 a quantity ( Qd for both will be 4, each) and profits will be 8.
If one cheats and the other doesn’t, the one that cheats gets a profit of 15>8, so there is an incentive to cheat, and the other gets 0 profit.
If they both cheat then they both get profits of 7.5<8.

45
Q

If they both collude they will set a price of 6 a quantity ( Qd for both will be 4, each) and profits will be 8.
If one cheats and the other doesn’t, the one that cheats gets a profit of 15>8, so there is an incentive to cheat, and the other gets 0 profit.
If they both cheat then they both get profits of 7.5<8.
Show this in a payoff matrix( example of the prisoners dilemma game and find Pure strategy Nash Equilbria?

A
46
Q

What if the collusion game was repeated a finite k times? how would we solve this?

A

We use backward induction.

47
Q

What are common thing we know about the prisoners dilemma for a one shot game?

A

Mutual defection ( cheat) is the pure strategy nash equibrium. As it strictly dominates

48
Q

Use backward induction to solve what the Sub Perfect Equilibrium is? ( remember all prior moves are observable) and what is the general result?

A

1) We know that at the final subgame, players must play a nash equilibrium in all SPE ( CHEAT, CHEAT)
2) Actions here cant affect the future cheating, you anticipate profits in the final subgame, meaning you need to be maximising now ( which is both cheating)
3) similarly at the first stage, your actions cant affect future play, so again they need to be maximising, they know they will get a flow of profits 7.5. in the future.
So generally the SPE of the finitely repeated PD is for the domiant strategy ( cheat) to be played in each stage.

49
Q

For finitely repeated games, if a stage game has only one unique Nash equilibrium, the subgame perfect equilibrium is?

A

is to play without considering past actions, treating the current subgame as a one-shot game.

50
Q

So in the prisioners dilemma it seems that cheating is inevitable, but now we are going to use if the game is repeated an infinite number of times, this may not always be the case. What do we need first?

A

Discount factor, a HIGH DELTA MEANS VERY PATIENT ( DISCOUNTING FACTOR LOW)
A LOW DELTA MEANS VERY IMPATIENT( DISCOUNTING FACTOR IS HIGH)

51
Q

Firm 1 is considering to cheat or not, and assume that firm 2 adopts a grim trigger strategy? What is that?

A

So the 2 firms will collude, but If cheating happens once, from firm 1, firm 2 will punish firm 1 forever. This punishment will be a minmax punishment, t is the worst that one player can do to the other, The worst punishment firm 2 can inflict on firm 1 is to set P=MC=2, so profits are 0( also harms firm 2)

52
Q

Will a price of 3 be a minmax punishment?

A

No a price of 3 will not be a minmax punishment, there has to be no incentive to deviate.

53
Q

Show the payoffs of firm 1 if they collude with firm 1 forever and if they cheat ? We know if they collude profit is 8 and if they cheat profits = 15.

A
54
Q

Recall how can we turn this infinite geometric sequence into an equation ( sum of a geometric sequence)

A

a/1-r

where a is the first term and r is common ratio.

55
Q

When is it optimal to collude?

A

if the present discounted value of the ‘collusion stream > that of the cheating stream. ( we don’t need to work out PV of 15 as its in the first period but watch out in the questions, there might be something in the second period, where you need to discount)
remember delta = 1/1+r so we can show the stream of cash flows, turn it into a geometric sequence, then get the sum of geometric sequence being >15.
We can rearrange to find what delta needs to be bigger than in order for collusion to be sustainable.

56
Q

How can we interpret this result?

A

Collusion is only optimal if delta is greater than 7/15 ( ie firms are sufficiently patient, to get income streams in the future) - remember delta = 1/1+r and if r is low, delta is high)
Is delta is lower than 7/15, firm 1 will cheat ( i.e if firm 1 is not patient, to get income streams in the future) - remember delta = 1/1+r and if r is high, delta is low.
If delta = the amount of patience firm 1 has, then firm 1 is indifferent on whether they cheat or not.

57
Q

So we have established that a factor that determines whether firms collude is how patient one firm is, but what else also is a big determination factor?

A

How many firms there are, as the number of firms increase, it becomes less attractive to collude.

58
Q

Show the payoffs of profits when there are n number of firms, when they one firm colludes or cheat ( the payoffs of profits are representative) Remember monopoly profit = 16 and if you cheat you get the market so profit = 15.

A
59
Q

We know that firms will collude if e if the present discounted value of the
‘collusion stream’ exceeds that of the ‘cheating stream’, show the geometric sequence and then rearrange to get n on one side?

A
60
Q

What would be the number of firms collusion is sustainable with?

A

n<5.33 so up to 5 firms.

61
Q

What is Folk theorem?

A
62
Q

In this collusion game with which is repeated infinite number of times, do players have incentive to deviate from trigger strategy?

A

• In equilibrium players have no incentive to deviate from the trigger strategy,
i.e. their commitment to the strategy is credible (SPE)

63
Q

What does the grim trigger strategy depend on?

A

the trigger strategy depends on being able to observe the decisions of
the rival firm, if cheating is not observable then its hard to sustain collusion. If firm 2 is suspicious that firm 1 has cheated, but in fact its just markets being violate, his misperception might lead him to trigger the grim trigger strategy, which is irreversible.

64
Q

• In 1993 the Danish Competition Council started to gather and publish firmspecific transaction prices for concrete, hoping that greater transparency forbuyers would lead to more competition
The result was the opposite! Average prices rose by 15-20% in less than a year (when consumer price inflation was 2%). There were no significant changes in
costs in that year
Why was this the case?

A

Collusion is going on (agreeing to set similar prices and these prices would be higher than before. Its easier to collude because its easier to detect cheating( everyone can see it)

65
Q

What makes collusion more less likely?

A

1) Lack of transparency - cheating difficult to detect
2) Many firms in the market ( or likelihood of new firms entering)
3) Leniency programmes for whistle-blowers.
4) Punishment is only short-lived( not grim)

66
Q

What is a whistle-blower?

A

You are exempt/ off the hook if you go to the police or suttin and snitch about the collusion agreement with other firms, if you feel worried about the collusion agreement.

67
Q

Some firms promise to refund the difference if a lower
price is found elsewhere. Do you expect this to:
A. Increase competition so lower consumer prices
B. Curtail competition so raise consumer prices
C. I don’t know

A

B. Such promises reduce the incentive for rivals to undercut, as they know
retaliation is automatic
They also imply that information about price-cutting is rapidly transmitted to
firms who are trying to collude
• Paradoxically, such promises serve to sustain higher prices!

68
Q

Are the Pure strategy Nash Equibria pareto optimal in the Prisoners Dilemma game

A

No, the NE is not Pareto Optimal. Pareto Optimality requires no
possible Pareto improvement, so no one could be made better off
without the other being made worse of.

69
Q
A
70
Q

(iii) Now suppose the firms can choose not to enter the market (or else enter with a specific technology), so the game is augmented as in the matrix below. Does this game have any pure strategy Nash equilibria?

A
71
Q

(iv) Now suppose the firms make decisions sequentially in a two-stage game. In the first stage Firm 1 decides whether to enter the industry, and, if it enters, it
chooses between a craft technology and an automated technology. In the
second stage Firm 2 chooses whether to enter the industry and, if it enters,
choose which technology to us.

A
72
Q
A

This is a coordination game, they could be friends and they want to study together.

1) The first payoff in the cells is Amil. His highest payoff is 80. and we look vertically down and we notice 80>30, so the best combination for him, is when Beth and him do course 1. ( do not write the both payoffs it is wrong)
2) When we look at Beth, the second payoff in the cells is hers. Her highest payoff is 80, we look horizontally to find this is where both of Amil and her are doing Course 2.
3) Who does best if the students do different courses? This means they cant study together. If Amil does course 2 and beth does course 1, beths payoff is higher and if we look at when Amil does course 1 and beth does course 2, beth ‘s payoff is still higher. No matter what beth does better.

73
Q

Use quick defintiions just as reference points.

A

Nash equilibrium = is a set of strategies, one for each player, that are best responses to each other.
PSNE = A strategy that a player plays with certainty
MSNE = A player who randomises their strategy.

74
Q

C.

A

g