DocumentCode
1296973
Title
Coordination Capacity
Author
Cuff, Paul Warner ; Permuter, Haim H. ; Cover, Thomas M.
Author_Institution
Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA
Volume
56
Issue
9
fYear
2010
Firstpage
4181
Lastpage
4206
Abstract
We develop elements of a theory of cooperation and coordination in networks. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what dependence can be established among the nodes given the communication constraints. Specifically, in a network with communication rates {Ri,j} between the nodes, we ask what is the set of all achievable joint distributions p(x1, ..., xm) of actions at the nodes of the network. Several networks are solved, including arbitrarily large cascade networks. Distributed cooperation can be the solution to many problems such as distributed games, distributed control, and establishing mutual information bounds on the influence of one part of a physical system on another.
Keywords
game theory; telecommunication networks; cascade network; communication constraint; communication network; communication rates; cooperation theory; coordination capacity; distributed control; distributed cooperation; distributed games; joint distribution; Communication networks; Computer networks; Decoding; Distributed computing; Distributed control; Joints; Markov processes; Mutual information; Network coding; Network topology; Probability distribution; Random processes; Rate-distortion; Source coding; Common randomness; Wyner common information; cooperation capacity; coordination capacity; network dependence; rate distortion; source coding; strong Markov lemma; task assignment;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2054651
Filename
5550277
Link To Document