Preprint
Aug 2026
Tight Information Complexity of the Coin Problem in the Broadcast Model
The characterisation shows that the two information costs can be quite different and identifies three parameter regimes, with optimal protocols based respectively on clean samples, a noisy binary symmetric channel, and an asymmetric $Z$-channel.
H. Kazemi, Varun Jog
· 0 citations