Distributed Compression with Selfish Terminals: Correlation Induces Anarchy

A hanging rack includes a support member and at least one hanger which is removably attached to the support member. The support member is provided with an internal receptacle having a receiving station adapted to releasably receive a plug attached to the hanger. The receptacle also includes a locking station which communicates with the receiving station such that the plug can be moved from the receiving station to the locking station, where it is releasably locked in place.

[1]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[2]  Aditya Ramamoorthy,et al.  Minimum Cost Distributed Source Coding Over a Network , 2007, IEEE Transactions on Information Theory.

[3]  João Barros,et al.  Network information flow with correlated sources , 2006, IEEE Transactions on Information Theory.

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[8]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[9]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[10]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[11]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[12]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[13]  Baltasar Beferull-Lozano,et al.  Networked Slepian-Wolf: theory, algorithms, and scaling laws , 2005, IEEE Transactions on Information Theory.

[14]  P. Gupta,et al.  Min-cost Selfish Multicast with Network Coding , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[15]  R. Koetter,et al.  Network Coding for Correlated Sources , 2004 .