Article

Algorithmica

, Volume 16, Issue 2, pp 133-150

Competitive distributed decision-making

  • Xiaotie DengAffiliated withDepartment of Computer Science, York University
  • , C. H. PapadimitriouAffiliated withDepartment of Computer Science, University of California at San Diego

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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