11.1 Multiagent decision making and Games in Extensive Form Flashcards
Normal-form games:
- Do not incorporate any notion of ___ or ___
- Assume agents select their actions ___
- Sequence or time
- Simultaneously
Extensive-form games:
- Have explicit ___
- Temporal structure
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 ___
- Graph
- Choice
- Action
- Outcome (payoffs/utility)
A pure strategy for an agent in a perfect-information game is a complete specification of which ___ to take at ___ belonging to that agent
Deterministic action
Every node
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 ___
Nash equilibrium
Nash equilibrium
Subgame-perfect equilibrium
Backward induction
Procedure to compute the ___
Also known by ___
Subgame-perfect equilibrium
Minimax algorithm
Backward induction process:
1- Identify the ___ in the “___” subgame trees
2- Consider that these ___ will ___
3- Back up and consider ___
1- Equilibria / “bottom-most”
2- Equilibria / be played
3- Increasingly larger trees
Backward induction EXERCISES
…