2000 character limit reached
Revisiting Common Randomness, No-signaling and Information Structure in Decentralized Control
Published 20 Jan 2024 in cs.IT, cs.SY, eess.SY, and math.IT | (2402.16862v1)
Abstract: This work revisits the no-signaling condition for decentralized information structures. We produce examples to show that within the no-signaling polytope exist strategies that cannot be achieved by passive common randomness but instead require agents to either share their observations with a mediator or communicate directly with each other. This poses a question mark on whether the no-signaling condition truly captures the decentralized information structure in the strictest sense.
- doi:https://doi.org/10.1016/j.sysconle.2007.03.010.
- doi:10.48550/ARXIV.2207.12075.
- doi:10.1103/PhysRevA.71.022101. URL https://link.aps.org/doi/10.1103/PhysRevA.71.022101
- doi:10.1214/20-PS356. URL https://doi.org/10.1214/20-PS356
- doi:10.1103/PhysRevLett.23.880. URL https://link.aps.org/doi/10.1103/PhysRevLett.23.880
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.