Distributed algorithmic mechanism design for scheduling on unrelated machines

被引：2
|
作者：
Carroll, Thomas E. [2 ]
Grosu, Daniel [1 ]
机构：
[1] Wayne State Univ, Dept Comp Sci, Detroit, MI 48202 USA
[2] Pacific NW Natl Lab, Richland, WA 99352 USA
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2011年 / 71卷 / 03期
关键词：
Algorithmic mechanism design; Scheduling on unrelated machines; Truthful mechanism; Distributed computation;
D O I：
10.1016/j.jpdc.2010.11.004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In classical mechanism design the outcome of the mechanism is computed by a trusted central party. In this paper, we consider the design of distributed mechanisms in which the outcome is computed by the agents themselves. We propose Distributed MinWork (DMW), a mechanism for solving the problem of scheduling on unrelated machines. We show that DMW is a faithful implementation of the MinWork mechanism, which was proposed by Nisan and Ronen in their seminal work (Nisan and Rouen (2001) [30]). We show that in addition to being faithful, DMW protects the anonymity of the losing agents and the privacy of their bids. Furthermore, we show that DMW is efficient as it has polynomial communication and computation costs. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码：397 / 406
页数：10
相关论文
共 50 条
  • [1] Distributed algorithmic mechanism design for scheduling on unrelated machines
    Carroll, TE
    Grosu, D
    [J]. 8th International Symposium on Parallel Architectures, Algorithms and Networks, Proceedings, 2005, : 194 - 199
  • [2] Mechanism Design for Fractional Scheduling on Unrelated Machines
    Christodoulou, George
    Koutsoupias, Elias
    Kovacs, Annamaria
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [3] Mechanism design for factional scheduling on unrelated machines
    Christodoulou, George
    Koutsoupias, Elias
    Kovacs, Annamaria
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 40 - +
  • [4] An improved randomized truthful mechanism for scheduling unrelated machines
    Lu, Pinyan
    Yu, Changyuan
    [J]. STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 527 - 538
  • [5] An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling
    Lei, Deming
    Yuan, Yue
    Cai, Jingcao
    Bai, Danyu
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020, 58 (02) : 597 - 614
  • [6] Stochastic Scheduling on Unrelated Machines
    Skutella, Martin
    Sviridenko, Maxim
    Uetz, Marc
    [J]. 31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 639 - 650
  • [7] Lookahead scheduling of unrelated machines
    Coleman, B
    Mao, WZ
    [J]. PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 397 - 400
  • [8] A metaheuristic algorithmic framework for solving the hybrid flow shop scheduling problem with unrelated parallel machines
    Zeng, Chuangfeng
    Liu, Jianjun
    [J]. ENGINEERING OPTIMIZATION, 2024,
  • [9] A Hybrid Imperialist Competitive Algorithm for the Distributed Unrelated Parallel Machines Scheduling Problem
    Zheng, Youlian
    Yuan, Yue
    Zheng, Qiaoxian
    Lei, Deming
    [J]. SYMMETRY-BASEL, 2022, 14 (02):
  • [10] Algorithmic mechanism design for load balancing in distributed systems
    Grosu, D
    Chronopoulos, AT
    [J]. 2002 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, PROCEEDINGS, 2002, : 445 - 450
12345