When Does Information Sharing Improve Decentralized Discovery? Aggregation, Independent Rescue, and Equilibrium Selection
Summary
This paper investigates the conditions under which information sharing can improve decentralized discovery processes, focusing on concepts like aggregation, independent rescue, and equilibrium selection.
View Cached Full Text
Cached at: 09/03/26, 05:57 AM
# When Does Information Sharing Improve Decentralized Discovery? Aggregation, Independent Rescue, and Equilibrium Selection Source: [https://arxiv.org/abs/2609.01814](https://arxiv.org/abs/2609.01814) Bibliographic Tools ## Bibliographic and Citation Tools Bibliographic Explorer Toggle Code, Data, Media ## Code, Data and Media Associated with this Article Demos ## Demos Related Papers ## Recommenders and Search Tools About arXivLabs ## arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website\. 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\. Have an idea for a project that will add value for arXiv's community?[**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html)\.
Similar Articles
Diverse Evidence, Better Forecasts: Multi-Agent Deliberation Under Information Asymmetry
This paper introduces InfoDelphi, a framework that uses information asymmetry (partitioning evidence into shared public and disjoint private subsets) to improve multi-agent LLM deliberation and forecasting. On the PolyGym benchmark, it outperforms single-agent and multi-agent baselines by 12-18% in Brier score and 4-8 percentage points in accuracy, demonstrating that diverse evidence is key to effective multi-agent reasoning.
The Role of Network Topology and Opponent Information in Shaping Cooperation in Multi-Agent Reinforcement Learning Systems
This paper explores the impact of network topology and opponent information on the emergence of cooperation in multi-agent reinforcement learning systems, specifically in the Iterated Prisoner's Dilemma, finding that graph structure and information availability significantly influence cooperative strategies.
Efficient Elicitation of Collective Disagreements
Introduces a stratified framework to identify the minimal aggregated preference information needed to compute disagreement measures, proposing the plurality matrix and showing that pairwise comparisons are insufficient; designs elicitation protocols that trade off participant numbers and cognitive load.
Agentic Share-of-Search: A Multi-Agent AI System for Competitive Decision-Making in LLM-Mediated E-Commerce
This paper introduces a multi-agent AI system for measuring and diagnosing competitive visibility in LLM-mediated e-commerce using Agentic Share-of-Search, with an ablation study showing feasibility.
When Does Multi-Agent Collaboration Help? An Entropy Perspective
This paper examines multi-agent systems (MAS) from an entropy perspective, analyzing intra- and inter-agent dynamics. It finds that single agents often outperform MAS and introduces the Entropy Judger algorithm to improve MAS performance.