11.1 Multiagent decision making and Games in Extensive Form Flashcards

1
Q

Normal-form games:

  • Do not incorporate any notion of ___ or ___
  • Assume agents select their actions ___
A
  • Sequence or time

- Simultaneously

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

Extensive-form games:

- Have explicit ___

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

Perfect-information games in extensive form:

  • A tree in the sense of ___ theory
  • Each node represents the ___ of an agent
  • Each edge represents an ___ of an agent
  • The leaves represent a final ___
A
  • Graph
  • Choice
  • Action
  • Outcome (payoffs/utility)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A pure strategy for an agent in a perfect-information game is a complete specification of which ___ to take at ___ belonging to that agent

A

Deterministic action

Every node

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

Every Subgame-perfect equilibrium is also a ___
Although not every ___ is a Subgame-perfect equilibrium
Also, every perfect-information extensive-form game has at least one ___

A

Nash equilibrium
Nash equilibrium
Subgame-perfect equilibrium

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

Backward induction
Procedure to compute the ___
Also known by ___

A

Subgame-perfect equilibrium

Minimax algorithm

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

Backward induction process:
1- Identify the ___ in the “___” subgame trees
2- Consider that these ___ will ___
3- Back up and consider ___

A

1- Equilibria / “bottom-most”
2- Equilibria / be played
3- Increasingly larger trees

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

Backward induction EXERCISES

A

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