Coordination Using Individually Shared Randomness

05/08/2018
by   Gowtham R. Kurri, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2019

Coordination Through Shared Randomness

We study a distributed sampling problem where a set of processors want t...
research
04/21/2019

Communication for Generating Correlation: A Survey

The task of manipulating correlated random variables in a distributed se...
research
10/05/2020

How to send a real number using a single bit (and some shared randomness)

We consider the fundamental problem of communicating an estimate of a re...
research
09/08/2023

The Randomness Deficiency Function and the Shift Operator

Almost surely, the difference between the randomness deficiencies of two...
research
04/07/2020

Source Coding for Synthesizing Correlated Randomness

We consider a scenario wherein two parties Alice and Bob are provided X_...
research
10/30/2018

Exact Channel Synthesis

We consider the exact channel synthesis problem, which is the problem of...
research
12/03/2019

Windable Heads Recognizing NL with Constant Randomness

Every language in NL has a k-head two-way nondeterministic finite automa...

Please sign up or login with your details

Forgot password? Click here to reset