A Game Solved by Hand

The Prompt

Find all Nash equilibria — pure and mixed — of a two-player game with at least three strategies per player. You may choose a game from the literature or invent your own. Work the computation by hand (the indifference principle for mixed equilibria). Record each equilibrium found and verify stability. If the game has multiple equilibria, note which one you would predict real players to reach and why.

Completion Criteria

The game matrix, all equilibria found (with supporting calculations), and a brief note on equilibrium selection.

Students who have attested

No Students have attested this quest yet. Be the first.