Truthful and Expected-Payment-Optimal Model Routing in Graph-Based Agentic Workflows
Assigning routine tasks to cheaper large language model (LLM) providers can reduce generation cost, but switching providers may require processing accumulated context again. Keeping dependent tasks with the same provider can instead reuse eligible context. Graph-based workflows therefore couple routing decisions across...
Jia-Yuan Liu, Ming-Yu Guo, Jia-Rui Gan et al.
· 0 citations