UniversityMathsNash equilibria, alpha–beta pruning and value iteration15–20 min
Games and Policies
Find pure and mixed Nash equilibria, prune a game tree with alpha–beta search, and optimise a grid-world policy with value iteration.
Notice, currentExplain, nextApply, next
0 points
The experiment opens when it comes into view.
Theory and model assumptions
Find pure and mixed Nash equilibria, prune a game tree with alpha–beta search, and optimise a grid-world policy with value iteration.
Teacher guidance
University, Game Theory and Decision Making
Expected time: 15–20 minutes.