Beyond competitive analysis [on-line algorithms]

Author

Koutsoupias, Elias ; Papadimitriou, Christos H.

Author_Institution

California Univ., Los Angeles, CA, USA

fYear

1994

fDate

20-22 Nov 1994

Firstpage

394

Lastpage

400

Abstract

The competitive analysis of on-line algorithms has been criticized as being too crude and unrealistic. We propose two refinements of competitive analysis an two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for on-line decision-making. We illustrate the first with an application to the paging problem; as a by product we characterize completely the work functions of this important special case of the k-server problem. We use the second refinement to explore the power of lookahead in server systems, and the power of visual sensors in robot navigation

Keywords

competitive algorithms; computational complexity; paged storage; competitive analysis; k-server problem; lookahead; on-line algorithms; on-line decision-making; paging problem; robot navigation; server systems; visual sensors; work functions; Algorithm design and analysis; Complexity theory; Decision making; Information analysis; Minimax techniques; Navigation; Performance analysis; Robot sensing systems; Sensor phenomena and characterization; Sensor systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on

Conference_Location

Santa Fe, NM

Print_ISBN

0-8186-6580-7

Type

conf

DOI

10.1109/SFCS.1994.365677

Filename

365677