402Pilot: An x402 Decision Layer for Autonomous Agent Micropayments
Not on the map. Why?
Abstract (arXiv)
Programmable-payment protocols such as x402 enable per-request micropayments, but they do not determine which payable service an autonomous agent should buy under a finite wallet. We formulate this buyer-side problem as agent-native payment decision-making: contextual provider selection under wallet pressure, chosen-only paid feedback, and changing market conditions. We propose 402Pilot, a protocol-agnostic buyer-side decision layer between autonomous agents and payment execution that implements purchasing policies for selecting among payable providers. We instantiate it with PA-DCT, a payment-aware discounted contextual Thompson-sampling policy that adapts purchasing decisions under wallet pressure while learning from post-payment feedback. To evaluate buyer-side payment policies, we introduce 402Pilot-Bench, a frozen-replay benchmark spanning 823 tasks, five heterogeneous provider pipelines, and three market regimes, each evaluated over 30 paired seeds. PA-DCT achieves the strongest fixed-wallet adaptive trade-off among non-oracle policies: it maintains competitive service quality while spending only 39 to 43 percent of the wallet and reallocates spending as market conditions change. It attains the best non-oracle PA-gap/T under the price shock and the best mean and worst-case ranks across the nine scenario-metric combinations of quality, ROI, and PA-gap/T. Comparisons with learning baselines and component ablations further support the effectiveness and design of the proposed decision policy. These results suggest that programmable payment must be complemented by buyer-side decision-making capable of learning service value and adapting purchasing decisions accordingly.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 24 references that are in the map. First posted on arXiv 2 Aug 2026.
Builds on
13 of 24 references.
References · 13
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
- 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
- 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
- 2013Learning to Optimize Via Posterior Samplingcited by 253
- 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 84
- 2015Linear Contextual Bandits with Knapsackscited by 82
- 2025LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routingcited by 32
- 2015Thompson Sampling for Budgeted Multi-armed Banditscited by 23
- 2024Sliding-Window Thompson Sampling for Non-Stationary Settingscited by 15
- 2026A402: Binding Cryptocurrency Payments to Service Execution for Agentic Commercecited by 6
1 more
Built on by
Not cited yet.