arXiv AI

A General Equilibrium Theory of Orchestrated AI Agent Systems

arXiv:2602. 21255v2 Announce Type: replace-cross Abstract: We establish a general equilibrium theory for systems of large language model (LLM) agents operating under centralized orchestration.

arXiv Machine Learning
Sep 17

Stability-Constrained Approximation in Spline KANs: Exact Layer Balancing and Budget-Compatible Saturation

The paper investigates how to balance approximation accuracy and stability in deep spline superposition networks under a strict layerwise Lipschitz budget. It provides an exact solution to the finite‑depth diagonal balancing problem, shows how to construct spline discretisations that respect the budget, and establishes minimax lower bounds for operators constrained in both first and third derivative norms. The authors also demonstrate that layer errors can accumulate linearly with depth, indicating that the upper bound is not merely a theoretical artifact.

By Aleksander Tankman
arXiv AI
Aug 26

The Shadow Price of Intelligence: Quality Degradation in LLM Inference as a Supply Chain Problem

The paper argues that large language model (LLM) providers, constrained by compute, often degrade service during congestion by routing queries to smaller models, cutting reasoning effort, or truncating context. It shows that this practice misrepresents costs because degraded answers can fail, leading to retries that inflate traffic or churn that erodes lifetime value. By modeling inference allocation with newsvendor, retry, and queueing frameworks, the authors derive a ‘shadow price of intelligence’ that quantifies the marginal value of each query, revealing that throttling under congestion acts as a demand lever rather than a cost lever.

By Elioth Sanabria
arXiv Machine Learning
Jul 14

Paradoxes of Game Theoretic Equilibria and Price of Anarchy

arXiv:2607. 11752v1 Announce Type: cross Abstract: For decades, static solution concepts (Nash, Correlated, and Coarse Correlated Equilibria) and the Price of Anarchy (PoA) have formed the bedrock of algorithmic game theory, with no-regret learning proving fast convergence to such game-theoretic equilibria.

By Georgios Piliouras, Ian Gemp, Siqi Liu, Luke Marris