Certifying information flow in multi-agent behaviours

We study which input-output behaviours of several agents can be produced by a declared communication schedule, that is, a fixed sequence of senders, recipients, message alphabets, and output times, together with shared randomness. Since a schedule admits only finitely many deterministic protocols, membership is a linear program, and an infeasible target is excluded by a separating inequality. Under explicit operational assumptions, we prove that the affine hull of the achievable behaviours is described exactly by the equalities stating that each joint output statistic depends only on the inputs that can reach the agents involved, so that a violated equality identifies both the statistic and the missing input. One binary message per event already attains this affine hull, so message capacity restricts which behaviours are achievable without being visible to any equality. We apply the result to one-bit broadcast and relay hierarchies for two and three agents, and to low-order projections of the local polytope.

Source: arXiv:2610.23631v1 - http://arxiv.org/abs/2610.23631v1 PDF: https://arxiv.org/pdf/2610.23631v1 Original Link: http://arxiv.org/abs/2610.23631v1