Strong meets empirical coordination conjecture
Statement
Let denote common randomness, with enough common randomness available—for example, . For a fixed network setting, let be the strong coordination capacity region and let be the empirical coordination capacity region. Strong meets empirical coordination conjecture. With unlimited common randomness, the strong coordination capacity region equals the empirical coordination capacity region:
This conjecture proposes that common randomness can augment an empirical coordination code to achieve strong coordination in any network setting. It is consistent with the network settings for strong coordination considered in the paper and is motivated by the reverse Shannon theorem in the two-node setting; whether it holds for arbitrary network coordination settings remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.