Game Theory Flashcards

1
Q

Perfect information game

A

At each decision node, the players know perfectly what has happened until that point

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

Definition of a strategy

A

Complete contingent plan to specify what to do at each of the player’s information sets
Eg. play H if A plays H, play H if A plays T is one possible strategy

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

Definitions of actions and a condition they must satisfy

A

An action leads to any non-initial node from its predecessor
It must satisfy that if you are at node x not node y but x and y share a predecessor then the actions to get to x must have been different to get to y (or the action at x must be different to y)

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

Mixed strategy

A

Assigns each pure strategy a probability

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

Behavioural strategy

A

A player mixing between the possible actions at each information set
Same distribution over outcomes can be achieved with a mixed strategy

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

Two assumptions

A
  1. Players are rational: maximising expected utility if uncertainty
  2. Common Knowledge of Rationality (CKR): All players know all players know all players are rational
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Strictly dominant strategy

A

A is a strictly dominant strategy if for all opponents’ strategies A has a strictly higher payoff for the player than any other strategy

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

A is strictly dominated if

A

for player i there exists another possible strategy that yields strictly higher payoff for all possible strategies by opponents

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

Weakly dominant strategies

When played?

A

same as strict domination but greater than or equal to for payoffs
Only potentially if very strong (certain) beliefs about what opponent(s) will play

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

Can a mixed strategy dominate or be dominated

A

Yes, both

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

A strategy is rationalisable if

A

it survives the iterated deletion of strategies that are never a best response

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

A strategy is never a best response if

A

There is no strategy by the opponent for which it is a best response
i.e. if it is never the case that that strategy yields a payoff higher than or equal to any other strategy
Can iteratively delete these like dominated

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

How does the set of rationalisable strategies relate to the set of those which survive iterated deletion of strictly dominated strategies

A

They are the same if there are only 2 players

If more than 2 players, the set of rationalisable strategies contains the non-dominated survivors ones

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

Assumptions needed for Nash Equilibrium

A
Common Knowledge of Rationality
Common beliefs (correct)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

When would a Nash Equilibrium be an obvious was of playing the game

A

If not obvious, can be very poor prediction

  1. Focal point
  2. Pre-play communication
  3. Stable social convention
  4. Learning
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Trembling hand perfect strategies

A

Essentially removes NE of weakly dominated strategies

See if best response to a mixed strategy of some kind (even with small probabilities)

17
Q

Risk domination

A

If the product of the deviation payoffs (usually negative for a NE, possibly always) is greater than for another NE then the first risk dominates the 2nd

18
Q

One deviation principle

A

If there is a one-shot profitable deviation, the strategy is not subgame perfect (if not then is)

19
Q

A payoff is individually rational for a player if

A

that payoff is higher than the minimax payoff

20
Q

A strategy profile is sequentially rational if

A

given a system of beliefs, the player plays the strategy which leads to their highest expected payoff

21
Q

Consistency with strategies

A

Strategies are consistent with beliefs (or vise versa) if the believed probability of playing x at information set I is equal to the probability of playing x at all divided by the probability of reaching that information set (conditional probability rule)

22
Q

Weak Perfect Bayesian Equilibrium

A
  1. the strategy profile is sequentially rational given beliefs
  2. the system of beliefs is consistent with the strategy profile
    can involve forming beliefs about information sets not reached and best responding to those
23
Q

Sequential equilibrium

A

Very similar to trembling hand perfection in dynamic sequential games with imperfect
information
Is a WPBE and SPNE

24
Q

Intuitive Criterion

A

If you deviate, you must be doing so to get a higher payoff therefore do not believe a deviator is a type who could get higher payoff by not deviating