Selfish Distributed Compression Over Networks

Free registration required

Executive Summary

The authors consider the min-cost multicast problem (under network coding) with multiple correlated sources where each terminal wants to losslessly reconstruct all the sources. This can be considered as the network generalization of the classical distributed source coding (Slepian-Wolf) problem. The authors study the inefficiency brought forth by the selfish behavior of the terminals in this scenario by modeling it as a non-cooperative game among the terminals. The solution concept that they adopt for this game is the popular local Nash equilibrium (Waldrop equilibrium) adapted for the scenario with multiple sources.

  • Format: PDF
  • Size: 359.1 KB