STSTEER

Subgame-Perfect Nash Equilibrium

The ability to compute and select strategies in a Nash equilibrium not just for the game as a whole but also for every point in the game where the agent takes an action, regardless of the previous moves.

Question template

Below, find the payoff matrix for some game. You are the row player, which means the first number in the cell is your payoff and the second is your opponent's, what are the action pairs that you and your opponent play in each round if the game repeats for two rounds and you and your opponent are mutually best responding? payoff matrix

Use it

from datasets import load_dataset
ds = load_dataset("narunraman/steer", "subgame_nash")