An Interpretable Automated Mechanism Design Framework with Large Language Models
Not on the map. Why?
Abstract (arXiv)
Mechanism design has long been a cornerstone of economic theory, with traditional approaches relying on mathematical derivations. Recently, automated approaches, including differentiable economics with neural networks, have emerged for designing payments and allocations. While both analytical and automated methods have advanced the field, they each face significant weaknesses: mathematical derivations are not automated and often struggle to scale to complex problems, while automated and especially neural-network-based approaches suffer from limited interpretability. To address these challenges, we introduce a novel framework that reformulates mechanism design as a code generation task. Using large language models (LLMs), we generate heuristic mechanisms described in code and evolve them to optimize over some evaluation metrics while ensuring key design criteria (e.g., strategy-proofness) through a problem-specific fixing process. This fixing process ensures any mechanism violating the design criteria is adjusted to satisfy them, albeit with some trade-offs in performance metrics. These trade-offs are factored in during the LLM-based evolution process. The code generation capabilities of LLMs enable the discovery of novel and interpretable solutions, bridging the symbolic logic of mechanism design and the generative power of modern AI. Through rigorous experimentation, we demonstrate that LLM-generated mechanisms achieve competitive performance while offering greater interpretability compared to previous approaches. Notably, our framework can rediscover existing manually designed mechanisms and provide insights into neural-network based solutions through Programming-by-Example. These results highlight the potential of LLMs to not only automate but also enhance the transparency and scalability of mechanism design, ensuring safe deployment of the mechanisms in society.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 73 references that are in the map. First posted on arXiv 16 Feb 2025.
Builds on
22 of 73 references.
References · 22
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2022Competition-Level Code Generation with AlphaCodecited by 1,462
- 2023Teaching Large Language Models to Self-Debugcited by 988
- 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 885
- 2023Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolutioncited by 551
- 2022InCoder: A Generative Model for Code Infilling and Synthesiscited by 498
- 2025rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinkingcited by 313
- 2023Self-Taught Optimizer (STOP): Recursively Self-Improving Code Generationcited by 148
- 2023InferFix: End-to-End Program Repair with LLMscited by 114
- 2023Learning Performance-Improving Code Editscited by 106
- 2021Neuro-Symbolic Artificial Intelligence: Current Trendscited by 54
- 2017Optimal Auctions through Deep Learning: Advances in Differentiable Economicscited by 38
10 more
- 2014Complexity of Mechanism Designcited by 33
- 2018Automated Mechanism Design via Neural Networkscited by 32
- 2020A Permutation-Equivariant Neural Network Architecture For Auction Designcited by 32
- 2024Inductive or Deductive? Rethinking the Fundamental Reasoning Abilities of LLMscited by 29
- 2016Learning Simple Auctionscited by 23
- 2025Brief analysis of DeepSeek R1 and its implications for Generative AIcited by 10
- 2021Automated Dynamic Mechanism Designcited by 8
- 2014Sampling and Representation Complexity of Revenue Maximizationcited by 7
- 2024Data-Driven Mechanism Design: Jointly Eliciting Preferences and Informationcited by 7
- 2023Worst-Case VCG Redistribution Mechanism Design Based on the Lottery Ticket Hypothesiscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.