## Abstract

We study several natural problems in distributed decision-making from the standpoint of competitive analysis; in these problems incomplete information is a result of the distributed nature of the problem, as opposed to the on-line mode of decision making that was heretofore prevalent in this area. In several simple situations of distributed scheduling, the competitive ratio can be computed exactly, and the different ratios can be used as a measure of the value of information and communication between decision-makers. In a more general distributed scheduling situation, we give tight upper and lower bounds on the competitive ratio achievable in the deterministic case, and give an optimal randomized algorithm with a much better competitive ratio.

### Key words

On-line algorithms Distributed computing Load balancing Distributed scheduling## Preview

Unable to display preview. Download preview PDF.

### References

- [Al]N. Alon, Personal communication, 1992.Google Scholar
- [Ar1]K. Arrow,
*The Economies of Information*, Harvard University Press, 1984.Google Scholar - [Ar2]K. Arrow, Personal communication, Stanford University, 1987.Google Scholar
- [BBK+]S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the Power of Randomization in Online Algorithms,
*Proceedings of the*22*nd Annual ACM Symposium on Theory of Computing*, 1990, pp. 379–386.Google Scholar - [BCR]R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins, Searching in the Plane,
*Information and Computation*,**106**(1993), 234–252.CrossRefGoogle Scholar - [BIR+]A. Borodin, S. Irani, P. Raghavan and B. Schieber, Competitive Paging with Locality of Reference,
*Proceedings of the*23*rd Annual ACM Symposium on Theory of Computing*, 1991, pp. 249–259.Google Scholar - [BKM+]S. Baruah, O. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha, On-Line Scheduling in the Presence of Overload,
*Proceedings of the*32*nd Annual Symposium on Foundations of Computer Science*, 1991, pp. 100–110.Google Scholar - [BLS]A. Borodin, N. Linial, and M. Saks, “An Optimal Online Algorithm for Metrical Task Systems,”
*Proceedings of the*19*th Annual ACM Symposium on Theory of Computing*, 1987, pp. 373–382.Google Scholar - [BRS]A. Blum, P. Raghavan, and B. Schieber, Navigating in Unfamiliar Geometric Terrain,
*Proceedings of the*23*rd Annual ACM Symposium on Theory of Computing*, 1991, pp. 494–504.Google Scholar - [CDR+]D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random Walks on Weighted Graphs, and Application to On-line Algorithms,
*Proceedings of the*22*nd Annual ACM Symposium on Theory of Computing*, 1991, pp. 369–378.Google Scholar - [DKP]X. Deng, T. Kameda and C. H. Papadimitriou, How To Learn an Unknown Environment,
*Proceedings of the*32*nd Annual Symposium on Foundations of Computer Science*, 1991, pp. 298–303.Google Scholar - [DM]X. Deng and S. Mahajan, Infinite Games: Randomization, Computability and Applications to Online Problems,
*Proceedings of the*23*rd Annual ACM Symposium on Theory of Computing*, 1991, pp. 289–298.Google Scholar - [DP]X. Deng and C. H. Papadimitriou, Exploring an Unknown Graph,
*Proceedings of the*31*st Annual Symposium on Foundations of Computer Science*, 1990, pp. 355–361.Google Scholar - [FFK+]A. Fiat, D. P. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan, Competitive Algorithms for Layered Graph Traversal,
*Proceedings of the*32*nd Annual Symposium on Foundations of Computer Science*, 1991, pp. 288–297.Google Scholar - [FRR]A. Fiat, Y. Rabani, and Y. Ravid, Competitive
*k*-Server Algorithms,*Proceedings of the*31*st Annual Symposium on Foundations of Computer Science*, 1990, pp. 454–463.Google Scholar - [FST]A. Feldmann, J. Sgall, and S. -H. Teng, Dynamic Scheduling on Parallel Machines,
*Proceedings of the*32*nd Annual Symposium on Foundations of Computer Science*, 1991, pp. 111–120.Google Scholar - [G]E. F. Grove, The Harmonic Online
*k*-Server Algorithm is Competitive,*Proceedings of the*23*rd Annual ACM Symposium on Theory of Computing*, 1991, pp. 260–266.Google Scholar - [GJ]M. R. Garey and D. S. Johnson,
*Computers and Intractability, A Guide to the Theory of NP-Completeness*, Freeman, New York, 1979.Google Scholar - [I]S. Irani, Coloring Inductive Graphs On-Line,
*Proceedings of the*31*st Annual Symposium on Foundations of Computer Science*, 1990, pp. 470–479.Google Scholar - [IR]S. Irani, and Yuval Rabani, On the Value of Information in Coordinated Games,
*Proceedings of the*34*th Symposium on Foundations of Computer Science*, 1994, pp. 12–21.Google Scholar - [K]R. Klein, Walking an Unknown Street with Bounded Detour,
*Proceedings of the*32*nd Annual Symposium on Foundations of Computer Science*, 1991, pp. 304–313.Google Scholar - [KMR+]A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, Competitive Snoopy Caching,
*Algorithmica*,**3**(1988), 79–119.MathSciNetGoogle Scholar - [KP]P. C. Kanellakis and C. H. Papadimitriou, The Complexity of Distributed Concurrent Control,
*Proceedings of the*22*nd Annual Symposium on Foundations of Computer Science*, 1981, pp. 185–197.Google Scholar - [KRR]H. Karloff, Y. Rabani, and Y. Ravid, Lower Bounds for Randomized
*k*-Server and Motion-Planning Algorithms,*Proceedings of the*23*rd Annual ACM Symposium on Theory of Computing*, 1991, pp. 278–288.Google Scholar - [LST]L. Lovasz, M. Saks, and W. A. Trotter, An On-line Graph Coloring Algorithm with Sublinear Performance Ratio, TM-ARH-013014, Bellcore.Google Scholar
- [MMS]M. S. Manasse, L. A. McGeoch, and D. D. Sleator, “Competitive Algorithms for On-Line Problems,”
*Proceedings of the*20*th Annual ACM Symposium on Theory of Computing*, 1988, pp. 322–333.Google Scholar - [PT]C. H. Papadimitriou and J. Tsitsiklis, Intractable Problems in Control Theory,
*SIAM Journal on Control and Optimization*,**24**(1986), 639–654.CrossRefGoogle Scholar - [PY1]C. Papadimitriou and M. Yannakakis, Shortest Paths Without a Map,
*Proceedings 16th ICALP*, 1989, pp. 610–620. Also in the special issue of*Theoretical Computer Science*,**84**(1991), 127–150.Google Scholar - [PY2]C. H. Papadimitriou and M. Yannakakis, On the Value of Information in Distributed Decision-Making,
*Proceedings*10*th PODC*, 1991, pp. 61–64.Google Scholar - [R]P. Raghavan, Randomized Rounding and Discrete Ham-Sandwich Theorems. Ph.D. Thesis, University of California, Berkeley, July 1986.Google Scholar
- [RS]P. Raghavan and M. Snir, “Memory vs. Randomization in Online Algorithms,”
*IBM Journal of Research and Development*,**38**(1994), 683–707.Google Scholar - [ST]D. D. Sleator and R. E. Tarjan, Amortized Efficiency of List Update and Paging Rules,
*Communications of the ACM*,**28**(2) (1985), 202–208.CrossRefGoogle Scholar - [SWW]D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling Parallel Machines On-line,
*Proceedings of the*32*nd Annual Symposium on Foundations of Computer Science*, 1991, pp. 131–140.Google Scholar - [V]S. Vishwanathan, Randomized On-line Coloring of Graphs,
*Proceedings of the*31*st Symposium on Foundations of Computer Science*, 1990, pp. 464–469.Google Scholar - [W]H. S. Witsenhausen, A Counterexample in Stochastic Optimum Control,
*SIAM Journal on Control and Optimization*,**6**(1968), 138–147.CrossRefGoogle Scholar