arXiv：cs.AI（全量分类）· Genliang Zhu, Chu Wang·· 5 小时前AI 评分37
分布式多智能体委派中的容错预算守恒
Fault-Tolerant Budget Conservation in Distributed Multi-Agent Delegation
AI 导读
研究形式化了分布式多智能体委派中的容错预算守恒问题，预算以独占托管信用额度形式在委派 DAG 中流转，分支在派发前将信用额度转换为绑定血缘、epoch、归一化效应、最大扣费、接收方与幂等键的操作预留。该机制在崩溃、重试、重复、分区、汇合与延迟完成等调度下保持已发放预算上界，并通过有界 TLA+ 检查、独立 JavaScript 探索器及崩溃注入的双进程 SQLite 实验验证。
正文
Abstract:Resource limits are becoming an authorization boundary for AI agents that delegate work across concurrent and failure-prone workers. Parent-child allocation constraints, affine objects, and distributed escrow do not by themselves prevent overspend when replies are lost, effects complete after timeout, messages repeat, branches partition, or DAG joins alias one lineage. We formalize fault-tolerant budget conservation for distributed multi-agent delegation. Budgets are quantized resource vectors represented by exclusive escrow credits that move through a delegation DAG. Before dispatch, a branch converts credit into an operation reservation bound to lineage, epoch, normalized effect, maximum charge, receiver, and idempotency key. It persists a signed dispatch permit with quarantine; the gateway verifies that permit before first acceptance. Uncertain effects remain charged until authenticated settlement, a fenced authoritative no-effect proof, or permanent retirement. We prove ownership partition, ledger and effect conservation, descendant non-amplification, at-most-once settlement, late-completion safety, and partition confinement under explicit mediation, durability, authentication, normalization, and gateway assumptions. An indistinguishability result shows that partition-local availability requires exclusive preallocation. Bounded TLA+ checking, an independent JavaScript explorer, and crash-injected two-process SQLite experiments exercise the declared scope and detect timeout-refund and historical-certificate-validation mutants. The mechanism preserves the issued budget bound across the evaluated crash, retry, duplicate, partition, join, and late-completion schedules.
| Comments: | 67 pages, 3 figures, 17 tables, 4 algorithms, and 3 listings. Includes formal proofs, bounded model checking, mutation analysis, and crash-injected two-process SQLite experiments |
| Subjects: | Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR); Distributed, Parallel, and Cluster Computing (cs.DC) |
| Cite as: | arXiv:2610.00349 [cs.AI] |
| (or arXiv:2610.00349v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2610.00349 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Genliang Zhu [view email]
[v1]
Tue, 29 Sep 2026 21:54:32 UTC (98 KB)
来源：arXiv：cs.AI（全量分类） · arxiv.org