Algorithmica

, Volume 16, Issue 2, pp 133–150

Competitive distributed decision-making

Authors

  • Xiaotie Deng
    • Department of Computer ScienceYork University
  • C. H. Papadimitriou
    • Department of Computer ScienceUniversity of California at San Diego
Article

DOI: 10.1007/BF01940643

Cite this article as:
Deng, X. & Papadimitriou, C.H. Algorithmica (1996) 16: 133. doi:10.1007/BF01940643

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 algorithmsDistributed computingLoad balancingDistributed scheduling
Download to read the full article text

Copyright information

© Springer-Verlag New York Inc 1996