ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be the number of TV channels, let kk be the coalition size, and let L~=1\tilde{L}=1. Write Jk,LJ_{k,L} for the original payoff and define the alternative payoff

Rk,L=Jk,L−1kI(Y^;S^∣X^K).R_{k,L}=J_{k,L}-\frac{1}{k}I(\hat Y;\hat S\mid\hat X_{\mathcal K}).

Here Y^\hat Y is the vector of pirate outputs, S^\hat S records the assignment of pirates to the TV channels, and X^K\hat X_{\mathcal K} is the part of the code matrices accessible to the coalition. Asymptotic optimality conjecture. In the binary alphabet case,

max⁡fWmin⁡{π},pC^Rk,L⟶L2k22ln⁡2,\max_{f_W}\min_{\{\pi\},p_{\hat C}}R_{k,L}\longrightarrow\frac{L^2}{k^2 2\ln 2},

with optimal strategies fW∗(w)=(πw(1−w))−1f_W^*(w)=(\pi\sqrt{w(1-w)})^{-1}, g∗(w)=wg^*(w)=w, and

pC^∗(c^)=∏l=1Lδ(cl,k/L).p_{\hat C}^*(\hat c)=\prod_{l=1}^{L}\delta(c^l,k/L).

The conjecture asserts that the alternative payoff has the same asymptotic maximin value as the original multiple-channel payoff. The proposed strategies are the arcsine bias distribution, the interleaving attack, and an even allocation of pirates across channels; the source provides motivation but no resolution.

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.