1. Game Theory Flashcards

1
Q

Rational decision maker

A

Someone who’s decisions can be accurately modelled

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

Actions

A

The alternatives from which a person can choose

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

Outcomes

A

The consequences that result from each possible action

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

Preferences

A

The player’s personal ranking over possible outcomes

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

What does X represent?

A

Outcome space

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

What makes a preference rational?

A

Completeness and transitivity

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

Completeness

A

When any two outcomes can be ranked by the preference relation

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

Transitivity

A

If a>b and b>c then a>c

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

When does a player follow a possible choice paradigm?

A
  1. They know all possible actions, A
  2. They know all possible outcomes, X
  3. They know the relationship between actions and outcomes
  4. They have rational preferences over outcomes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Lottery

A

A finite set of outcomes with an associated probability to each outcome

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

Independence axiom

A

States if x1>x2 then px1 + (1-p)x3 > px2 + (1-p)x3 for all 0<p></p>

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

Continuity axiom

A

If x1>x2>x3 then there exists p such that px1 + (1-p)x3 = x2

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

What is a normal game?

A

Step 1: each players chooses a strategy simultaneously and independently
Step 2: conditional on players choices, payoffs are distributed to each player

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

What is a payoff function?

A

It maps every combination of pure strategies to a player n’s payoff

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

Strategy profile

A

A possible combination of all players strategies

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

Dominant strategy

A

When one strategy produces a higher payoff regardless of the strategies chosen by other players

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

What is IESDS?

A

Iterated Elimination of Strictly Dominating Strategies. Where we remove dominating strategies from the game

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

Nash equilibrium

A

A strategy profile where no individual has a unilateral incentive to change their behaviour. It is a concept of stability

19
Q

Best response correspondence

A

A mapping from strategies for all players other than n into the subsets of Sn

20
Q

How do you find a players best response when given a utility function

A
  • Maximising for each s2
  • FOC sets this equal to 0
  • since the best responses are unique, a NE is formed and the best responses found
21
Q

If there is no pure strategy how can you best play the game?

A

Randomise between strategies

22
Q

What will a rational decision maker do when facing randomness in others choices?

A

Pick his strategy to maximise his expected payoff

23
Q

When will players mix between pure strategies?

A

When they are indifferent between them

24
Q

What is a function?

A

Something that maps one input to one output

25
What is a correspondence?
Something that maps one input to multiple outputs
26
Sequential games
Games that unfold over time
27
How is a nash equilibrium sometimes too general for extensive games?
* some equilibrium may not be self enforcing | * players may be able to anticipate other players’ moves
28
What is a subgame perfect Nash equilibrium?
It must be a best response at each node, given the strategies of other players. It is a refinement of Nash Equilibrium
29
What is a sub game?
It consists of a single decision node and all of its successors in a game
30
How are SPNE solved?
With backwards induction.
31
Pareto improvement
Everyone is at least as well off as before and someone is better off
32
When do SPNE exist?
They always exist
33
One deviation unimprovable
If there is no decision node where changing the strategy improves the outcomes of the game
34
One deviation principle
A one deviation unimprovable strategy is optimal
35
How can we check an SPNE quickly?
Using one deviation principle. You only need to consider one change at a time at each node
36
What is the discount rate?
A way of measuring future payoffs compared to present payoffs. It is a value between 0 and 1
37
What is a repeated game?
A normal form game that is played multiple times in succession by the same players. The players roles stay the same as do their strategy spaces
38
Conditional strategy
Assigns a strategy at period t according to what happened in every previous round
39
What is grim trigger?
It is a strategy where p1 will cooperate until p2 defects, then p1 will defect for every subsequent round
40
What is a sub game for a repeated game?
A sub game of a repeated game is any number of repetitions which is smaller than T
41
How can we find out if a SPNE is satisfied?
We check to see if at any period t there exists a single profitable deviation. If there is then it isn’t an SPNE
42
What is the relationship between the NE of a normal form game and a repeated game?
In any repeated game, if the normal form game has a unique NE, then G has a unique SPNE where the NE of g is played in every period
43
How do we check if we have a SPNE in an infinitely repeated game?
All sub games are equivalent to the total game so we just need to check if any player wants to deviate in period 1
44
What is a convex Hull?
It is the set of all convex combinations of the given vectors