Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
From MaRDI portal
Publication:5111740
DOI10.4230/LIPICS.ESA.2017.51zbMath1442.90075OpenAlexW2760080258MaRDI QIDQ5111740
Sungjin Im, Benjamin Moseley, Kirk R. Pruhs, Clifford Stein
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7828/pdf/LIPIcs-ESA-2017-51.pdf/
Related Items (3)
A poly-log competitive posted-price algorithm for online metrical matching on a spider ⋮ Unnamed Item ⋮ Dynamic pricing of servers on trees
Cites Work
- Unnamed Item
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Coordination mechanisms for selfish scheduling
- Algorithmic mechanism design (extended abstract)
- Optimal Coordination Mechanisms for Multi-job Scheduling Games
- On-Line Load Balancing of Temporary Tasks
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Pricing Online Decisions: Beyond Auctions
- Algorithmic Game Theory
- Automata, Languages and Programming
This page was built for publication: Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing