When Does Information Sharing Improve Decentralized Discovery? Aggregation, Independent Rescue, and Equilibrium Selection

arXiv نُشر في تم التحديث الذكاء الاصطناعي وتعلّم الآلة
سجّل الدخول للحفظ

يُعرض هذا المقال بلغته الإنجليزية الأصلية.

لماذا يهم

التحليل معروض بالإنجليزية · الترجمة العربية قيد الإعداد

The article presents a theoretical model on information sharing in decentralized discovery, demonstrating conditions under which pooled estimates improve outcomes compared to independent actions. The research highlights that a registered incremental-sharing protocol can enhance discovery when pooled residual error contracts faster than independent rescue attempts, with results dependent on signal accuracy and equilibrium selection. The models are synthetic and do not involve real-world data or organizations.

التأثير المتوقع على السوق

محايد الثقة 30% كيف تُقرأ نسبة الثقة الأفق الزمني: المدى الطويل الأثر: الأدنى

The article does not provide direct evidence of market-relevant events, assets, or sectors. The theoretical framework may indirectly influence research into AI-driven decision-making, data-sharing protocols, or decentralized systems, but no specific transmission mechanism to public markets is identifiable from the content.

المخاطر

  • The article is a theoretical mathematical model with no empirical or market-relevant data
  • No named assets, sectors, or organizations are referenced, limiting direct market impact assessment

مسار الأدلة

الأدلة
المصدر arXiv
الادّعاء When Does Information Sharing Improve Decentralized Discovery? Aggregation, Independent Rescue, and Equilibrium Selection
استنتاج الذكاء الاصطناعي محايد · 30%
أُنشئ في 2026-09-03 04:00

مصدر التحليل بالذكاء الاصطناعي

حُلِّل بواسطة Mistral Small Latest المنهجية v1.0 أُنشئ في
المعرّفات التقنية
وسم المزوّد
mistral-small-latest
إصدار التحليل
mistral-small-latest
معرّف المقال
126650

المصدر الأصلي

arXiv:2609.01814v1 Announce Type: new Abstract: Information sharing can improve a pooled estimate while eliminating independent rescue actions. This paper separates those effects in exact finite discovery models. A centralized action-budget profile shows that equal one-person accuracy can coexist with different portfolio values. Under a registered incremental-sharing protocol, a sharing step improves discovery exactly when pooled residual error contracts faster than an independent rescue attempt. Exact bounded registries exhibit compression, aggregation, neutral curves, and a bounded zero mixed class. In a two-agent Bayesian game with a hidden mixture of common and independent signal sources, the registered selected equilibrium yields a strict positive sharing interval at signal accuracy 3/5, while alternative equilibria show that the result is selection-dependent rather than universal. The models are synthetic and finite; no human or organizational data are used.

اقرأ المقال كاملاً على arXiv

المقال الأصلي منشور بواسطة arXiv في 3 سبتمبر 2026. التحليل والرؤى المقدمة من AnalystMarkets AI.

تغطية ذات صلة