The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
Bibliographic record
Abstract
When players in a game face messy decisions—like yes/no choices, rules layered within rules, or conflicting objectives—traditional algorithms often fail to find stable outcomes. Carvalho, Dragotto, Lodi, and Sankaranarayanan introduce a new algorithm, Cut-and-Play, that breaks this barrier. Unlike previous methods, Cut-and-Play handles nonconvex and unbounded decision spaces—the kind often found in real-world markets, public policy, and artificial intelligence systems. It works by iteratively solving simpler approximations of a complex game and then refining them with mathematical “cuts” until a solution is reached. Most strikingly, the algorithm finds equilibria up to 10× faster than existing techniques and is the first of its kind to offer a general-purpose solution method for this class of problems. The work is a leap forward for both the theory and application of strategic decision making.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.014 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.004 | 0.001 |
| Scholarly communication | 0.004 | 0.000 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".