Selfish Distributed Compression over Networks

A. Ramamoorthy, V. Roychowdhury, S. K. Singh
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2n2fyi4qgfa53mwrtarkk6ysnm" style="color: black;">IEEE INFOCOM 2009 - The 28th Conference on Computer Communications</a> </i> &nbsp;
We 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. We study the inefficiency brought forth by the selfish behavior of the terminals in this scenario by modeling it as a noncooperative game among the terminals. The solution concept that we adopt for this game is
more &raquo; ... he popular local Nash equilibrium (Waldrop equilibrium) adapted for the scenario with multiple sources. The degradation in performance due to the lack of regulation is measured by the Price of Anarchy (POA), which is defined as the ratio between the cost of the worst possible Waldrop equilibrium and the socially optimum cost. Our main result is that in contrast with the case of independent sources, the presence of source correlations can significantly increase the price of anarchy. Towards establishing this result we make several contributions. We characterize the socially optimal flow and rate allocation in terms of four intuitive conditions. This result is a key technical contribution of this paper and is of independent interest as well. Next, we show that the Waldrop equilibrium is a socially optimal solution for a different set of (related) cost functions. Using this, we construct explicit examples that demonstrate that the POA > 1 and determine neartight upper bounds on the POA as well. The main techniques in our analysis are Lagrangian duality theory and the usage of the supermodularity of conditional entropy. Finally, all the techniques and results in this paper will naturally extend to a large class of network information flow problems where the Slepian-Wolf polytope is replaced by any contra-polymatroid (or more generally polymatroid-like set), leading to a nice class of succinct multi-player games and allow the investigation of other practical and meaningful scenarios beyond network coding as well.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2009.5062277">doi:10.1109/infcom.2009.5062277</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/infocom/RamamoorthyRS09.html">dblp:conf/infocom/RamamoorthyRS09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xn6oc54j4res3eceuopjcli5lu">fatcat:xn6oc54j4res3eceuopjcli5lu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719052603/https://lib.dr.iastate.edu/cgi/viewcontent.cgi?referer=&amp;httpsredir=1&amp;article=1032&amp;context=ece_conf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/aa/aa/aaaa0e90f8e74132da5c849f0224bdbb2936773b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2009.5062277"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>