Delayed information and action in on-line algorithms

DOI10.1006/inco.2001.3057zbMath1005.68070OpenAlexW2045220797MaRDI QIDQ1854463

Moses Charikar, Susanne Albers, Michael Mitzenmacher

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3057

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

The ski-rental problem with multiple discount options ⋮ On the on-line rent-or-buy problem in probabilistic environments ⋮ On searching strategies, parallel questions, and delayed answers ⋮ Adaptive demand peak management in online transport process planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combined BIT and TIMESTAMP algorithm for the list update problem
• Randomized competitive algorithms for the list update problem
• Coloring inductive graphs on-line
• A new measure for the study of on-line algorithms
• Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information
• Better Bounds for Online Scheduling
• An optimal on-line algorithm for metrical task system
• The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
• Universal Portfolios
• Optimal control of arrivals to queues with delayed queue length information
• Linear programming without the matrix
• Competitive distributed file allocation
• On the value of information in distributed decision-making (extended abstract)
• How useful is old information (extended abstract)?
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Delayed information and action in on-line algorithms