Coordination Using Individually Shared Randomness

TL;DR

This paper investigates how two processors can coordinate their outputs using shared randomness and a coordinator, providing a characterization of communication rates needed and trade-offs with shared randomness.

Contribution

It offers a complete characterization of the communication rate for coordination with unlimited shared randomness and presents a trade-off between communication and shared randomness rates.

Findings

Characterized the communication rate with unlimited shared randomness.

Provided an achievable trade-off between communication and shared randomness.

Analyzed the coordination problem in a broadcast setting.

Abstract

Two processors output correlated sequences using the help of a coordinator with whom they individually share independent randomness. For the case of unlimited shared randomness, we characterize the rate of communication required from the coordinator to the processors over a broadcast link. We also give an achievable trade-off between the communication and shared randomness rates.