Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing

Authors Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein

Thumbnail PDF


  • Filesize: 418 kB
  • 10 pages

Document Identifiers

Author Details

Sungjin Im
Benjamin Moseley
Kirk Pruhs
Clifford Stein

Cite AsGet BibTex

Sungjin Im, Benjamin Moseley, Kirk Pruhs, and Clifford Stein. Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 51:1-51:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


We consider a setting where selfish agents want to schedule jobs on related machines. The agent submitting a job picks a server that minimizes a linear combination of the server price and the resulting response time for that job on the selected server. The manager's task is to maintain server prices to (approximately) optimize the maximum response time, which is a measure of social good. We show that the existence of a pricing scheme with certain competitiveness is equivalent to the existence of a monotone immediate-dispatch algorithm. Our main result is a monotone immediate-dispatch algorithm that is O(1)-competitive with respect to the maximum response time.
  • Posted pricing scheme
  • online scheduling
  • related machines
  • maximum flow time
  • competitiveness analysis


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Fidaa Abed, José R. Correa, and Chien-Chung Huang. Optimal coordination mechanisms for multi-job scheduling games. In Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings, pages 13-24, 2014. Google Scholar
  2. S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, and Amit Kumar. Minimizing maximum (weighted) flow-time on related and unrelated machines. Algorithmica, 77(2):515-536, 2017. Google Scholar
  3. James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3), May 1997. Google Scholar
  4. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, and Orli Waarts. On-line load balancing of temporary tasks. Journal of Algorithms, 22(1):93-110, 1997. Google Scholar
  5. Nikhil Bansal and Bouke Cloostermans. Minimizing maximum flow-time on related machines. Theory of Computing, 12(1):1-14, 2016. Google Scholar
  6. Julian Birkinshaw. Strategies for managing internal competition. California Management Review, 44(1):21-38, 2001. Google Scholar
  7. George Christodoulou, Elias Koutsoupias, and Akash Nanavati. Coordination mechanisms. In International Colloquium on Automata, Languages and Programming, pages 345-357, 2004. Google Scholar
  8. Ilan Reuven Cohen, Alon Eden, Amos Fiat, and Lukasz Jez. Pricing online decisions: Beyond auctions. In ACM-SIAM Symposium on Discrete Algorithms, pages 73-91, 2015. Google Scholar
  9. Shelley DuBois. Internal competition at work: Worth the trouble? Fortune, February 25 2012. Google Scholar
  10. Michal Feldman, Amos Fiat, and Alan Roytman. Makespan minimization via posted prices. unpublished, 2017. Google Scholar
  11. Amos Fiat. Makespan minimization via posted prices, November 3 2016. talk given under the auspices of the Algorithms and Uncertainty program at the Simons Institute for the Theory of Computing at the University of California at Berkeley. Google Scholar
  12. Sungjin Im, Benjamin Moseley, and Kirk Pruhs. A tutorial on amortized local competitiveness in online scheduling. SIGACT News, 42(2):83-97, 2011. Google Scholar
  13. Nicole Immorlica, Erran L. Li, Vahab S. Mirrokni, and Andreas S. Schulz. Coordination mechanisms for selfish scheduling. In International Workshop on Internet and Network Economics, pages 55-69, 2005. Google Scholar
  14. Noam Nisan and Amir Ronen. Algorithmic mechanism design (extended abstract). In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA, pages 129-140, 1999. Google Scholar
  15. Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani. Algorithmic Game Theory. Cambridge University Press, New York, NY, USA, 2007. Google Scholar
  16. Kirk Pruhs, Jirí Sgall, and Eric Torng. Online scheduling. In Handbook of Scheduling - Algorithms, Models, and Performance Analysis. 2004. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail