Generate synthetic game-theory training data to fine-tune a language model.
Measure whether fine-tuning improves a model's ability to find Nash equilibria.
Score a model's predictions exactly, with no subjective grading involved.
Run a training-size sweep to see how data volume affects reasoning improvement.
| setrf/gt-bench | 0xhassaan/nn-from-scratch | 3ks/embedoc | |
|---|---|---|---|
| Stars | 0 | 0 | — |
| Language | Python | Python | Python |
| Last pushed | — | — | 2023-06-08 |
| Maintenance | — | — | Dormant |
| Setup difficulty | hard | moderate | hard |
| Complexity | 4/5 | 4/5 | 1/5 |
| Audience | researcher | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Fine-tuning experiments require a Tinker API key and access to the configured base model.
GT-Bench is a research benchmark for testing and improving how AI language models reason about game theory. Game theory is the study of strategic decision making, or how rational players choose actions when the outcome depends on what others do too. The core task is simple and precisely verifiable: given a two player payoff matrix, a grid showing what each player earns for every combination of choices, the model must identify all pure strategy Nash equilibria and briefly explain its reasoning. A Nash equilibrium is a stable outcome where neither player would benefit by switching their choice on their own. Exact scoring means there is no subjective grading, so the benchmark can cleanly measure whether fine tuning a model actually improved that specific skill. The repository generates training, validation, and test datasets, then evaluates a model before and after fine tuning to compare scores. The published experiment uses three training set sizes, 250, 1000, and 5000 examples, on a large language model to measure how data volume affects improvement. Beyond the narrow two player task, a broader suite covers mixed strategy equilibria, larger game matrices, sequential game reasoning solved by backward induction, game descriptions written in plain English that must be mapped to a payoff structure, and repeated round prisoner's dilemma scenarios. Each of these families has its own generator and scoring script, and scoring stays exact throughout. The project is written in Python and was created by a UC Berkeley master's student as part of a Thinking Machines Lab Tinker research grant. It includes scripts to generate datasets, run a baseline model, fine-tune with LoRA through the Tinker service, and score predictions, along with an arXiv-ready research paper describing the results. The full README is longer than what was shown.
A verifiable benchmark that tests whether fine-tuning improves a language model's ability to solve game theory problems like Nash equilibria.
Mainly Python. The stack also includes Python, Tinker, LoRA.
No license information is provided in the README.
Setup difficulty is rated hard, with roughly 1h+ to a first successful run.
Mainly researcher.
This repo across BitVibe Labs
Verify against the repo before relying on details.