Algorithmica

, Volume 16, Issue 2, pp 133–150 | Cite as

Competitive distributed decision-making

  • Xiaotie Deng
  • C. H. Papadimitriou
Article

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.

Unable to display preview. Download preview PDF.

References

  1. [Al]
    N. Alon, Personal communication, 1992.Google Scholar
  2. [Ar1]
    K. Arrow,The Economies of Information, Harvard University Press, 1984.Google Scholar
  3. [Ar2]
    K. Arrow, Personal communication, Stanford University, 1987.Google Scholar
  4. [BBK+]
    S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the Power of Randomization in Online Algorithms,Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 379–386.Google Scholar
  5. [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
  6. [BIR+]
    A. Borodin, S. Irani, P. Raghavan and B. Schieber, Competitive Paging with Locality of Reference,Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 249–259.Google Scholar
  7. [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 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 100–110.Google Scholar
  8. [BLS]
    A. Borodin, N. Linial, and M. Saks, “An Optimal Online Algorithm for Metrical Task Systems,”Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 373–382.Google Scholar
  9. [BRS]
    A. Blum, P. Raghavan, and B. Schieber, Navigating in Unfamiliar Geometric Terrain,Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 494–504.Google Scholar
  10. [CDR+]
    D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random Walks on Weighted Graphs, and Application to On-line Algorithms,Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1991, pp. 369–378.Google Scholar
  11. [DKP]
    X. Deng, T. Kameda and C. H. Papadimitriou, How To Learn an Unknown Environment,Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 298–303.Google Scholar
  12. [DM]
    X. Deng and S. Mahajan, Infinite Games: Randomization, Computability and Applications to Online Problems,Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 289–298.Google Scholar
  13. [DP]
    X. Deng and C. H. Papadimitriou, Exploring an Unknown Graph,Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 355–361.Google Scholar
  14. [FFK+]
    A. Fiat, D. P. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan, Competitive Algorithms for Layered Graph Traversal,Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 288–297.Google Scholar
  15. [FRR]
    A. Fiat, Y. Rabani, and Y. Ravid, Competitivek-Server Algorithms,Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 454–463.Google Scholar
  16. [FST]
    A. Feldmann, J. Sgall, and S. -H. Teng, Dynamic Scheduling on Parallel Machines,Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 111–120.Google Scholar
  17. [G]
    E. F. Grove, The Harmonic Onlinek-Server Algorithm is Competitive,Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 260–266.Google Scholar
  18. [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
  19. [I]
    S. Irani, Coloring Inductive Graphs On-Line,Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 470–479.Google Scholar
  20. [IR]
    S. Irani, and Yuval Rabani, On the Value of Information in Coordinated Games,Proceedings of the 34th Symposium on Foundations of Computer Science, 1994, pp. 12–21.Google Scholar
  21. [K]
    R. Klein, Walking an Unknown Street with Bounded Detour,Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 304–313.Google Scholar
  22. [KMR+]
    A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, Competitive Snoopy Caching,Algorithmica,3(1988), 79–119.MathSciNetGoogle Scholar
  23. [KP]
    P. C. Kanellakis and C. H. Papadimitriou, The Complexity of Distributed Concurrent Control,Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 185–197.Google Scholar
  24. [KRR]
    H. Karloff, Y. Rabani, and Y. Ravid, Lower Bounds for Randomizedk-Server and Motion-Planning Algorithms,Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 278–288.Google Scholar
  25. [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
  26. [MMS]
    M. S. Manasse, L. A. McGeoch, and D. D. Sleator, “Competitive Algorithms for On-Line Problems,”Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 322–333.Google Scholar
  27. [PT]
    C. H. Papadimitriou and J. Tsitsiklis, Intractable Problems in Control Theory,SIAM Journal on Control and Optimization,24 (1986), 639–654.CrossRefGoogle Scholar
  28. [PY1]
    C. Papadimitriou and M. Yannakakis, Shortest Paths Without a Map,Proceedings 16th ICALP, 1989, pp. 610–620. Also in the special issue ofTheoretical Computer Science,84 (1991), 127–150.Google Scholar
  29. [PY2]
    C. H. Papadimitriou and M. Yannakakis, On the Value of Information in Distributed Decision-Making,Proceedings 10th PODC, 1991, pp. 61–64.Google Scholar
  30. [R]
    P. Raghavan, Randomized Rounding and Discrete Ham-Sandwich Theorems. Ph.D. Thesis, University of California, Berkeley, July 1986.Google Scholar
  31. [RS]
    P. Raghavan and M. Snir, “Memory vs. Randomization in Online Algorithms,”IBM Journal of Research and Development,38 (1994), 683–707.Google Scholar
  32. [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
  33. [SWW]
    D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling Parallel Machines On-line,Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 131–140.Google Scholar
  34. [V]
    S. Vishwanathan, Randomized On-line Coloring of Graphs,Proceedings of the 31st Symposium on Foundations of Computer Science, 1990, pp. 464–469.Google Scholar
  35. [W]
    H. S. Witsenhausen, A Counterexample in Stochastic Optimum Control,SIAM Journal on Control and Optimization,6 (1968), 138–147.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc 1996

Authors and Affiliations

  • Xiaotie Deng
    • 1
  • C. H. Papadimitriou
    • 2
  1. 1.Department of Computer ScienceYork UniversityNorth YorkCanada
  2. 2.Department of Computer ScienceUniversity of California at San DiegoLa JollaUSA

Personalised recommendations