ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ω\omega denote common randomness, with enough common randomness available—for example, ω∼Unif⁡{[0,1]}\omega \sim \operatorname{Unif}\{[0,1]\}. For a fixed network setting, let C‾p0\underline{\mathcal C}_{p_0} be the strong coordination capacity region and let Cp0\mathcal C_{p_0} 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:

C‾p0=Cp0.\underline{\mathcal C}_{p_0}=\mathcal C_{p_0}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.