Mathematical Framing for Different Agent Strategies
Philip Stephens, Emmanuel Salawu
TL;DR
This work presents a unified probabilistic framework that models AI agent architectures—from monolithic ReAct loops to multi-agent collaborations—as chains of probabilities. It introduces the Degrees of Freedom as the key levers for optimization and formalizes inter-agent collaboration through context-propagating probabilities, including a cost-regularized objective to balance performance and efficiency. By tying ReAct, MAS, and control-flow paradigms to a common mathematical language, the paper enables principled architectural comparisons and guides design toward maximizing the probability of achieving goal actions. It also connects to standards like MCP and A2A, and suggests future probabilistic search methods that exploit the expanded collaboration surface for robust, scalable AI systems.
Abstract
We introduce a unified mathematical and probabilistic framework for understanding and comparing diverse AI agent strategies. We bridge the gap between high-level agent design concepts, such as ReAct, multi-agent systems, and control flows, and a rigorous mathematical formulation. Our approach frames agentic processes as a chain of probabilities, enabling a detailed analysis of how different strategies manipulate these probabilities to achieve desired outcomes. Our framework provides a common language for discussing the trade-offs inherent in various agent architectures. One of our many key contributions is the introduction of the "Degrees of Freedom" concept, which intuitively differentiates the optimizable levers available for each approach, thereby guiding the selection of appropriate strategies for specific tasks. This work aims to enhance the clarity and precision in designing and evaluating AI agents, offering insights into maximizing the probability of successful actions within complex agentic systems.
