On the value of information in coordination games

We discuss settings where several "agents" combine efforts to solve problems. This is a well-known setting in distributed artificial intelligence. Our work addresses theoretical questions in this model which are motivated by the work of X. Deng and C.H. Papadimitriou (1992). We consider optimization problems, in particular load balancing and virtual circuit routing, in which the input is divided among the agents. An underlying directed graph, whose nodes are the agents, defines the constraints on the information each agent may have about the portion of the input held by other agents. The questions we discuss are: Given a bound on the maximum out-degree in this graph, which is the best graph? What is the quality of the solution obtained as a function of the maximum out-degree?.<<ETX>>

[1]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[2]  Alok Aggarwal,et al.  On communication latency in PRAM computations , 1989, SPAA '89.

[3]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[5]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[6]  Joel S. Demski,et al.  Value of Information in Bimatrix Games , 1988 .

[7]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[8]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[9]  Mihalis Yannakakis,et al.  Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.

[10]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[11]  Maurice Herlihy,et al.  Contention in shared memory algorithms , 1993, JACM.

[12]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[13]  Mihalis Yannakakis,et al.  Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..

[14]  Baruch Awerbuch,et al.  A Tradeoff between Information and Communication in Broadcast Protocols , 1988, AWOC.

[15]  Mihalis Yannakakis,et al.  Linear programming without the matrix , 1993, STOC.