The Unbounded Benefit of Encoder Cooperation for the $k$-user MAC
Parham Noorzad, Michelle Effros, Michael Langberg

TL;DR
This paper shows that in certain $k$-user MACs, even minimal cooperation can lead to unbounded capacity gains, highlighting the significant potential of encoder cooperation in network communication.
Contribution
It introduces a class of $k$-user MACs where the ratio of capacity gain to cooperation rate becomes infinite as cooperation diminishes, a novel theoretical insight.
Findings
Existence of MACs with unbounded benefit-to-cost ratio
Binary erasure MAC for $k=2$ exemplifies this phenomenon
Gaussian MACs for any $k extgreater{}1$ also demonstrate this property
Abstract
Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of a -user multiple access channel (MAC) and a node that is connected to all encoders via rate-limited bidirectional links, referred to as the "cooperation facilitator" (CF). Define the cooperation benefit as the sum-capacity gain resulting from the communication between the encoders and the CF and the cooperation rate as the total rate the CF shares with the encoders. This work demonstrates the existence of a class of -user MACs where the ratio of the cooperation benefit to cooperation rate tends to infinity as the cooperation rate tends to zero. Examples of channels in this class include the binary erasure MAC for and the -user Gaussian MAC for any .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
