Complete Decentralized Mechanism Design for Online Machine Scheduling

Yuan Zhang,Chi-Hung Chi,Shengqing Zhang,Nan Zheng

Zhejiang（2009）

引用 0|浏览0

暂无评分

摘要

We study an online version of the classical parallel scheduling problem to minimize the total weighted completion time in a total decentralized setting: both the jobs and the machines are selfish entities who try to maximize their own interest. We study the setting from an algorithmic mechanism design and present a polynomial time decentralized scheduling mechanism that induces the rational jobs and machines to report truthfully about their private information, and lures the jobs to choose proper machines such that the resulting schedule is 3.281-competitive.

查看译文

关键词

decentralized scheduling mechanism,total decentralized setting,classical parallel scheduling problem,algorithmic mechanism design,online machine scheduling,proper machine,online version,polynomial time,own interest,private information,total weighted completion time,complete decentralized mechanism design,schedules,job shop scheduling,computational complexity,job design,job scheduling,mechanism design,polynomials,probability density function,embedded software,grid computing,distributed computing,data mining,decentralized system,scheduling algorithm,environmental economics,scheduling problem,parallel systems,cloud computing

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要