Making commitments in the face of uncertainty: How to pick a winner almost every time

Baruch Awerbuch, Yossi Azar, Amos Fiat, Tom Leighton

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we formulate and provide optimal solutions for a broad class of problems in which a decisionmaker is required to select from among numerous competing options. The goal of the decision-maker is to select the option that will have the best future performance. This task is made difficult by the constraint that the decision-maker has no way to predict the future performance of any of the options. Somewhat surprisingly, we find that the decision-maker can still (at least in several important scenarios) pick a winner with high probability. Our result has several applications. For example, consider the problem of scheduling background jobs on a network of workstations (NOW) when very little is known about the future speed or availability of each workstation. In this problem, the goal is to schedule each job on a workstation which will have enough idle capacity to complete the job within a reasonable or specified amount of time. This task is complicated by the fact that any particular workstation might become saturated by higher priority jobs shortly after one of our jobs is assigned to it, in which case progress will not be made on our job. Thus, in order to complete the jobs within a specified amount of time, we need to be able to accurately guess (or predict) which workstations will be idle and when. Somewhat surprisingly, it is possible to make such guesses with a very high degree of accuracy, even though very little is assumed about the future availability of the workstations. For example, if at least k of n workstations will be available for at least D units of time each (spread out over some interval of I units of time), then with probability at least 1-0(1/n), we will be able to complete k log n jobs with duration Ω(D/log n) within the interval. The result holds for all k, d, n, and I, and only knowledge of n is needed in order to schedule the tasks. For small values of k, the result is far superior to the (seemingly optimal) "dartthrowing" approach in which each job is assigned to a random workstation in the hope that it will be idle. Our results can also be used to provide the first competitive algorithm for the video-on-demand scheduling problem as well as the more general on-line set cover problem. The results may also be of interest in the context of investment planning, strategic planning, and other areas where it is important to be able to predict the future moves of an adversary or a market.

Original languageEnglish
Title of host publicationProceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996
PublisherAssociation for Computing Machinery
Pages519-530
Number of pages12
ISBN (Electronic)0897917855
DOIs
StatePublished - 1 Jul 1996
Event28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States
Duration: 22 May 199624 May 1996

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129452
ISSN (Print)0737-8017

Conference

Conference28th Annual ACM Symposium on Theory of Computing, STOC 1996
Country/TerritoryUnited States
CityPhiladelphia
Period22/05/9624/05/96

Fingerprint

Dive into the research topics of 'Making commitments in the face of uncertainty: How to pick a winner almost every time'. Together they form a unique fingerprint.

Cite this