a dominant strategy is: optimal regardless of what other players do

the minimax theorem says: in zero-sum games, there's a saddle point strategy

Minimax theorem guarantees a saddle point strategy in zero-sum games

Prisoner's dilemma

Prisoner's dilemma illustrates how individual rationality can lead to collectively worse outcomes

Nash equilibrium

Nash equilibrium: no unilateral gain

Greedy vs dynamic programming: greedy makes locally optimal choices, DP considers all subproblems

Greedy: locally optimal choices; DP: considers all subproblems

Zero-sum game

Zero-sum game: one player's gain equals another's loss

mechanism design does: designs rules so rational agents produce desired outcomes

Mechanism design constructs rules for desired outcomes