Decentralized LLM Workflows via Sequential Auctions

arXiv:2610.22201v1 Announce Type: cross Abstract: We present a scalable framework for solving multi-step tasks through a decentralized market of self-interested agents. Prior theoretical work demonstrated that agents organized through sequential auctions can converge to a globally optimal policy in a Markov decision process (MDP), but relied on the restrictive assumption of the existence of perfect clones as a model of perfect competition. In reality, exact clones drive agent profit to zero, violating the natural risk-reward incentives of participants. Conversely, we empirically demonstrate that the opposite extreme, absence of competition, also leads to market failure and value extraction collapse. Between these two extremes, we investigate how heterogeneous agents can survive in markets that span the critical middle ground of imperfect competition. To be profitable, agents learn to strategically shade bids to secure positive individual profit margins, while still ensuring that the marketplace functions effectively enough so that collaborative tasks posed by market consumers can still be solved. We formulate and evaluate four bidding algorithms (Mirror Descent, Thompson Sampling, Bayes-Optimal, and PPO) across three auction protocols (1st-Price, 2nd-Price, and Credit-Conserving Vickrey). Across a diverse set of domains, we demonstrate that imperfect competition successfully sustains necessary agent profit margins while maintaining high task success rates at low costs.

Related

• Learning to Steer LLM Agents and Multi-Agent Systems
• When 'Must' Becomes 'Maybe': Constraint Weakening in LLM Agent Workflows
• Multi-Agent AI Safety as an Institutional Design Problem
• Governance by Design: Architecting Agentic AI for Organizational Learning and Scalable Autonomy

Source: arXiv cs.AI | 2026-10-16