Jones Ray

ScholarPulse 日报 2026-10-15

2026-10-15 学术简报：2 篇。研究表明，AI代理市场的“竞争底线”与提示词“条件近独立性”特征可显著降低一阶价格拍卖（FPA）的无序代价，使其福利保障显著优于通用的 $1-1/e$。

今日速览

序号标题来源日期主题推荐等级
1Price of Anarchy of First-Price Auctions in Agentic MarketsarXiv2026-10-14AI-Agent高
2One Task, Many Interfaces: Simple Cross-Interface Consistency Training Improves LLM Agent RobustnessarXiv2026-10-14AI-Agent高

重点论文与技术动态

1. Price of Anarchy of First-Price Auctions in Agentic Markets

一句话结论

研究表明，AI代理市场的“竞争底线”与提示词“条件近独立性”特征可显著降低一阶价格拍卖（FPA）的无序代价，使其福利保障显著优于通用的 1−1/e1-1/e。

核心内容

方法与数据

价值判断

摘要 An agentic market is a decentralized serving-time market where AI agents bid to claim each user prompt. An agent's bid is based on its expected value for the prompt, which is the expectation of the reward for its response minus its inference costs. First-price auctions (FPAs), in which the highest bidder pays its bid and receives the prompt, are a natural way to allocate prompts in such a market, since they are simple and transparent to run, and do not require central knowledge of private capabilities and costs. However, FPAs are not truthful: participants may bid less than their true value in the hope of a larger profit, and the prompt may then be allocated to someone other than the bidder who values it the most. This welfare loss is quantified by the $\textit{price-of-anarchy}$ (PoA). In this paper, we argue that agentic markets are likely to possess features that reduce the price-of-anarchy. The first is a $\textit{competitive floor}$, which occurs when multiple bidders usually value the prompt above some baseline share of the optimal welfare (e.g., because the best models are often distilled into cheaper alternatives, which perform similarly). We show that competition among them then limits the welfare loss, which can be driven to zero as the floor rises. The second feature is $\textit{near-independence}$ of values after conditioning on the prompt, which occurs when most of the predictable variation in the expected value is determined by the difficulty of the prompt. As the value distribution approaches conditional independence, we can derive an efficiency guarantee that approaches a factor of $1 - 1/e^2$ of the optimal welfare. Thus, both features give rise to welfare lower bounds that are significantly better than the well-known general case of $1 - 1/e$. We validate these results empirically using auctions with strategic bidders simulated on the EmbedLLM prompt routing dataset.

2. One Task, Many Interfaces: Simple Cross-Interface Consistency Training Improves LLM Agent Robustness

一句话结论

论文提出跨界面策略正则化（CIPR），通过自监督一致性训练，显著提升大语言模型智能体在交互界面变动下的鲁棒性。

核心内容

方法与数据

价值判断

摘要 Post-training binds the competence of an LLM agent to the interface it was trained on. Semantics-preserving perturbations of that interface, such as renaming an action or changing the notation, leave the underlying task unchanged yet make the agent worse at it. Scoring each sample independently means interface randomization only broadens this dependence from a single interface to the training interface distribution, so out-of-distribution perturbations still degrade the agent. We propose Cross-Interface Policy Regularization (CIPR), a self-supervised objective that replaces action names with uninformative identifiers and presents each training sample under two interfaces in which equivalent actions are identified by construction. CIPR penalizes the KL divergence between the action distributions induced under the two interfaces, so the policy behaves consistently across them. We evaluate CIPR in both supervised and reinforcement-learning post-training, where it improves robustness. On agentic function calling, held-out interface perturbations reduce the accuracy of a post-trained agent by nearly 25%, and CIPR recovers 10.5% while leaving accuracy on the unchanged interface intact.