KMS Of Academy of mathematics and systems sciences, CAS
| Efficient Mechanism Design for Online Scheduling | |
Chen, Xujin1 ; Hu, Xiaodong1; Liu, Tie-Yan2; Ma, Weidong2; Qin, Tao2; Tang, Pingzhong3; Wang, Changjun4; Zheng, Bo3
| |
| 2016 | |
| Source Publication | JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
 |
| ISSN | 1076-9757 |
| Volume | 56Pages:429-461 |
| Abstract | This paper concerns the mechanism design for online scheduling in a strategic setting. In this setting, each job is owned by a self-interested agent who may misreport the release time, deadline, length, and value of her job, while we need to determine not only the schedule of the jobs, but also the payment of each agent. We focus on the design of incentive compatible (IC) mechanisms, and study the maximization of social welfare (i.e., the aggregated value of completed jobs) by competitive analysis. We first derive two lower bounds on the competitive ratio of any deterministic IC mechanism to characterize the landscape of our research: one bound is 5, which holds for equal-length jobs; the other bound is kappa/In kappa + -o(1), which holds for unequal-length jobs, where kappa is the maximum ratio between lengths of any two jobs. We then propose a deterministic IC mechanism and show that such a simple mechanism works very well for two models: (1) In the preemption-restart model, the mechanism can achieve the optimal competitive ratio of 5 for equal-length jobs and a near optimal ratio of (1/(1-epsilon)(2) + o(1)) kappa/In kappa for unequal-length jobs, where 0 < epsilon < 1 is a small constant; (2) In the preemption-resume model, the mechanism can achieve the optimal competitive ratio of 5 for equal-length jobs and a near optimal competitive ratio (within factor 2) for unequal-length jobs. |
| Language | 英语 |
| WOS Research Area | Computer Science |
| WOS Subject | Computer Science, Artificial Intelligence |
| WOS ID | WOS:000396193800001 |
| Publisher | AI ACCESS FOUNDATION |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/24960 |
| Collection | 应用数学研究所 |
| Corresponding Author | Chen, Xujin |
| Affiliation | 1.Chinese Acad Sci, AMSS, Beijing, Peoples R China 2.Microsoft Res, Beijing, Peoples R China 3.Tsinghua Univ, Beijing, Peoples R China 4.Beijing Univ Technol, Beijing, Peoples R China |
| Recommended Citation GB/T 7714 | Chen, Xujin,Hu, Xiaodong,Liu, Tie-Yan,et al. Efficient Mechanism Design for Online Scheduling[J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH,2016,56:429-461. |
| APA | Chen, Xujin.,Hu, Xiaodong.,Liu, Tie-Yan.,Ma, Weidong.,Qin, Tao.,...&Zheng, Bo.(2016).Efficient Mechanism Design for Online Scheduling.JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH,56,429-461. |
| MLA | Chen, Xujin,et al."Efficient Mechanism Design for Online Scheduling".JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 56(2016):429-461. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment