首页    期刊浏览 2024年12月01日 星期日
登录注册

文章基本信息

  • 标题:Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
  • 本地全文:下载
  • 作者:Sungjin Im ; Benjamin Moseley ; Kirk Pruhs
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2017
  • 卷号:87
  • 页码:51:1-51:10
  • DOI:10.4230/LIPIcs.ESA.2017.51
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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
国家哲学社会科学文献中心版权所有