Dynamic pricing of servers on trees
From MaRDI portal
Publication:5875461
Cites work
- scientific article; zbMATH DE number 6381644 (Why is no real title available?)
- scientific article; zbMATH DE number 7378697 (Why is no real title available?)
- A competitive 2-server algorithm
- An Optimal On-Line Algorithm for K Servers on Trees
- An optimal on-line algorithm for metrical task system
- Minimizing maximum flow time on related machines via dynamic posted pricing
- New Ressults on Server Problems
- Non-cooperative cost sharing games via subsidies
- On the competitive ratio of the work function algorithm for the k-server problem
- Online Weighted Matching
- Pricing online decisions: beyond auctions
- Reducing truth-telling online mechanisms to online optimization
- The \(k\)-server problem
- Tight bounds for double coverage against weak adversaries
- \(k\)-server via multiscale entropic regularization
Cited in
(2)
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)