Optimizing Service Operations via LLM-Powered Multi-Agent Simulation

Yanyuan Wang, Xiaowei Zhang
4/6/2026
cs.AIcs.MAmath.OC

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

Service system performance depends on how participants respond to design choices, but modeling these responses is hard due to the complexity of human behavior. We introduce an LLM-powered multi-agent simulation (LLM-MAS) framework for optimizing service operations. We pose the problem as stochastic optimization with decision-dependent uncertainty: design choices are embedded in prompts and shape the distribution of outcomes from interacting LLM-powered agents. By embedding key numerical information in prompts and extracting it from LLM-generated text, we model this uncertainty as a controlled Markov chain. We develop an on-trajectory learning algorithm that, on a single simulation run, simultaneously constructs zeroth-order gradient estimates and updates design parameters to optimize steady-state performance. We also incorporate variance reduction techniques. In a sustainable supply chain application, our method outperforms benchmarks, including blackbox optimization and using LLMs as numerical solvers or as role-playing system designers. A case study on optimal contest design with real behavioral data shows that LLM-MAS is both as a cost-effective evaluator of known designs and an exploratory tool that can uncover strong designs overlooked by traditional approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2026optimizing,
  title  = {Optimizing Service Operations via LLM-Powered Multi-Agent Simulation},
  author = {Yanyuan Wang and Xiaowei Zhang},
  year   = {2026},
  eprint = {2604.04383},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2604.04383v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2604.04383.svg)](https://codeofpaper.com/paper/2604.04383)

Discussion