Shared Information -- New Insights and Problems in Decomposing Information in Complex Systems
Nils Bertschinger, Johannes Rauh, Eckehard Olbrich, J\"urgen, Jost

TL;DR
This paper critically examines the decomposition of shared information in complex systems, revealing limitations of existing measures, proposing new properties for evaluation, and connecting information theory with game theory concepts.
Contribution
It investigates additional properties like strong symmetry and left monotonicity, showing their incompatibility with existing measures, and explores geometric and game-theoretic frameworks for understanding shared information.
Findings
Strong symmetry is incompatible with Williams and Beer's properties.
No proposed measure satisfies left monotonicity.
Shared knowledge can exist among independent agents in game theory.
Abstract
How can the information that a set of random variables contains about another random variable be decomposed? To what extent do different subgroups provide the same, i.e. shared or redundant, information, carry unique information or interact for the emergence of synergistic information? Recently Williams and Beer proposed such a decomposition based on natural properties for shared information. While these properties fix the structure of the decomposition, they do not uniquely specify the values of the different terms. Therefore, we investigate additional properties such as strong symmetry and left monotonicity. We find that strong symmetry is incompatible with the properties proposed by Williams and Beer. Although left monotonicity is a very natural property for an information measure it is not fulfilled by any of the proposed measures. We also study a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
