Dynamic pricing of servers on trees

DOI10.4230/LIPICS.APPROX-RANDOM.2019.10OpenAlexW2978005652MaRDI QIDQ5875461FDOQ5875461

Authors: Ilan Reuven Cohen, Alon Eden, Łukasz Jeż, 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

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

Cites Work

• An Optimal On-Line Algorithm for K Servers on Trees
• An optimal on-line algorithm for metrical task system
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• New Ressults on Server Problems
• The \(k\)-server problem
• Online Weighted Matching
• Non-cooperative cost sharing games via subsidies
• A competitive 2-server algorithm
• Title not available (Why is that?)
• Pricing online decisions: beyond auctions
• Reducing truth-telling online mechanisms to online optimization
• Tight bounds for double coverage against weak adversaries
• \(k\)-server via multiscale entropic regularization
• Minimizing maximum flow time on related machines via dynamic posted pricing
• Title not available (Why is that?)

Cited In (2)

• A poly-log competitive posted-price algorithm for online metrical matching on a spider
• Decentralized pricing in minimum cost spanning trees

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

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