{"slug":"agents-that-carry-their-own-insurance-policy","citations":[{"url":"https://arxiv.org/abs/2512.08737","committed_hash":"sha256:3b62adb140c7572534af86321ff602859a652604044e5286c754aa529f3ecca3","committed_hash_short":"sha256:3b62adb1…9f3ecca3","mime_type":"text/html","committed_at":"2026-09-11T05:00:24.716324+00:00","content_snapshot":"\n\n\n [2512.08737] Insured Agents: A Decentralized Trust Insurance Mechanism for Agentic Economy\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n \n \n \n \n\n\n
\n Skip to main content\n \n \n \n
\n \n\n \n \"archive\"\n \n\n \n\n \n
\n\n\n
\n
\n
\n\n
\n
\n

Computer Science > Computers and Society

\n
\n\n
\n arXiv:2512.08737 (cs)\n
\n\n
\n
\n
\n [Submitted on 9 Dec 2025]
\n

Title:Insured Agents: A Decentralized Trust Insurance Mechanism for Agentic Economy

\n
Authors:Botao 'Amber' Hu, Bangdao Chen
\n View PDF\n HTML (experimental)\n\n\n\n
\n Abstract:The emerging "agentic web" envisions large populations of autonomous agents coordinating, transacting, and delegating across open networks. Yet many agent communication and commerce protocols treat agents as low-cost identities, despite the empirical reality that LLM agents remain unreliable, hallucinated, manipulable, and vulnerable to prompt-injection and tool-abuse. A natural response is "agents-at-stake": binding economically meaningful, slashable collateral to persistent identities and adjudicating misbehavior with verifiable evidence. However, heterogeneous tasks make universal verification brittle and centralization-prone, while traditional reputation struggles under rapid model drift and opaque internal states. We propose a protocol-native alternative: insured agents. Specialized insurer agents post stake on behalf of operational agents in exchange for premiums, and receive privileged, privacy-preserving audit access via TEEs to assess claims. A hierarchical insurer market calibrates stake through pricing, decentralizes verification via competitive underwriting, and yields incentive-compatible dispute resolution.\n
\n\n \n
\n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n
Comments:Submitted to AAMAS 2026
Subjects:\n Computers and Society (cs.CY); Multiagent Systems (cs.MA)
Cite as:arXiv:2512.08737 [cs.CY]
 (or \n arXiv:2512.08737v1 [cs.CY] for this version)\n
  https://doi.org/10.48550/arXiv.2512.08737
\n \n \n
\n arXiv-issued DOI via DataCite
\n
\n
\n
\n
\n
\n
\n

Submission history

From: Botao Amber Hu [view email]
[v1]\n Tue, 9 Dec 2025 15:47:16 UTC (407 KB)
\n
\n
\n \n
\n \n Full-text links:\n

Access Paper:

\n \n
\n \"license\n view license\n
\n
\n
\n

Current browse context:

\n
cs.CY
\n\n
\n\n < prev\n \n   |   \n next >\n
\n
\n new\n | \n recent\n | 2025-12\n
\n Change to browse by:\n
\n cs
\n cs.MA
\n
\n
\n\n
\n
\n

References & Citations

\n \n
\n
\n\n
\n \n \n
\n\n
\n

Bookmark

\n \"BibSonomy\"/\n \n \n \"Reddit\"/\n \n
\n \n\n
\n
\n \n
\n

Bibliographic and Citation Tools

\n
\n
\n
\n \n
\n
\n Bibliographic Explorer (What is the Explorer?)\n
\n
\n
\n
\n \n
\n
\n Connected Papers (What is Connected Papers?)\n
\n
\n
\n \n
\n
\n Litmaps (What is Litmaps?)\n
\n
\n
\n
\n \n
\n
\n scite Smart Citations (What are Smart Citations?)\n
\n
\n
\n
\n
\n
\n
\n
\n\n\n \n \n
\n

Code, Data and Media Associated with this Article

\n
\n
\n
\n \n
\n
\n alphaXiv (What is alphaXiv?)\n
\n
\n\n
\n
\n \n
\n
\n CatalyzeX Code Finder for Papers (What is CatalyzeX?)\n
\n
\n\n
\n
\n \n
\n
\n DagsHub (What is DagsHub?)\n
\n
\n \n
\n
\n \n
\n
\n Gotit.pub (What is GotitPub?)\n
\n
\n\n
\n
\n \n
\n
\n Hugging Face (What is Huggingface?)\n
\n
\n\n
\n
\n \n
\n
\n ScienceCast (What is ScienceCast?)\n
\n
\n
\n\n
\n
\n
\n
\n
\n
\n
\n\n\n \n \n
\n

Demos

\n
\n
\n
\n \n
\n
\n Replicate (What is Replicate?)\n
\n
\n
\n
\n \n
\n
\n Hugging Face Spaces (What is Spaces?)\n
\n
\n
\n
\n \n
\n
\n TXYZ.AI (What is TXYZ.AI?)\n
\n
\n
\n
\n
\n
\n
\n \n \n
\n

Recommenders and Search Tools

\n
\n
\n
\n \n
\n
\n Influence Flower (What are Influence Flowers?)\n
\n
\n
\n
\n \n
\n
\n CORE Recommender (What is CORE?)\n
\n
\n
\n
\n \n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n\n \n \n
\n
\n
\n

arXivLabs: experimental projects with community collaborators

\n

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

\n

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

\n

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

\n
\n
\n

\n
\n
\n
\n\n
\n
\n\n
\n Which authors of this paper are endorsers? |\n Disable MathJax (What is MathJax?)\n \n
\n \n
\n
\n
\n\n
\n\n \n\n\n\n","snapshot_chars":41172,"live_check":"matches"}]}