Week 1 Flashcards

1
Q

What are the 3 ways interests can be between the players of a game?

A
  1. Completely conflicting
  2. Completely aligned
  3. When players can collude it’s a mix of both
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What different order of moves can a game have?

A
  1. Sequential
  2. Simultaneous
  3. A mix of both
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the 5 ways information can be held by players in a game

A

Imperfect
Perfect
Incomplete
Complete
Asymmetric

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

What is the difference between perfect and imperfect information

A

When there is perfect information, a player knows all the previous moves of all the players. When there is imperfect info some players do not know some of the previous moves of other players

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

What is incomplete information

A

Incomplete - some players do not know something (e.g. payoffs) about the game before it starts

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

Define asymmetric information

A

When some players know more than others.
Info can be asymmetric when info is incomplete or imperfect

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

What is strategic uncertainty and what kind of situations do you see it in?

A

Not knowing what others have chosen or will choose. Evident in situations with multiple equilibria or players are choosing mixed strategies

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

How often can games be played?

A

One shot
finitely repeated
infinitely repeated i.e. uncertain number of repetitions in a game - can be ended after any round

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

On a game tree what is a players strategy?

A

A complete plan of action for the entire game. Must indicate a move at every possible node.
Can be given to a friend to play on your behalf

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

What is backward induction?

A

When you begin at the end of the game (the last decision nodes) and reason backwards.
- Used in games with complete information

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

What is forward induction?

A

Begin at the start of the game and reason forwards.

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

What is the strategy found using backward induction called?

A

Subgame perfect Nash equilibrium, or rollback equilibrium

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

How do you work out the total number of strategies a player has on a game tree?

A

The number of pathways from 1 decision node, to the power of the total number of decision nodes.

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

What is a zero-sum game

A

When players have completely conflicting interest. Someone always wins and loses

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