Dynamic pricing of servers on trees

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.10OpenAlexW2978005652MaRDI QIDQ5875461

Łukasz Jeż, Ilan Reuven Cohen, Alon Eden, Amos Fiat

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.10

zbMATH Keywords

online algorithms\(k\)-server problemonline pricingonline mechanisms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

A poly-log competitive posted-price algorithm for online metrical matching on a spider

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-server problem
• Non-cooperative cost sharing games via subsidies
• A competitive 2-server algorithm
• Tight bounds for double coverage against weak adversaries
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Reducing truth-telling online mechanisms to online optimization
• An optimal on-line algorithm for metrical task system
• Online Weighted Matching
• Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
• k-server via multiscale entropic regularization
• Pricing Online Decisions: Beyond Auctions

This page was built for publication: Dynamic pricing of servers on trees