Nearly Optimal Competitive Online Replacement Policies

DOI10.1287/MOOR.22.4.814MaRDI QIDQ4385163zbMATH OpenOpenAlexFDO

Authors Ran El-Yaniv, Richard Karp

Publication date 1 July 1998

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9560fe7cb2c915ea3d83c2309dfe3d9ce227f1b6

zbMATH Keywords

competitive ratioonline replacement problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) 2-person games (91A05)

Recommendations

• Competitive optimal on-line leasing
• An optimal on-line algorithm for metrical task system
• scientific article; zbMATH DE number 437568

Cited in

(9)

• The ski-rental problem with multiple discount options
• Online leasing problem with price fluctuations and the second-hand transaction
• Rent or buy problems with a fixed time horizon
• On the on-line rent-or-buy problem in probabilistic environments
• Competitive analysis of the online financial lease problem
• A 2-competitive algorithm for online convex optimization with switching costs
• Competitive analysis for online leasing problem with compound interest rate
• Competitive strategy for on-line leasing of depreciable equipment
• Online leasing problem with price fluctuations under the consumer price index

This page was built for publication: Nearly Optimal Competitive Online Replacement Policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385163)