VCG is the Best Anonymous Scheduling Mechanism Itai Ashlagi Harvard and Shahar Dobzinski The School of Computer Science and Engineering, The Hebrew University of Jerusalem and Ron Lavi Faculty of Industrial Engineering and Management, The Technion, Israel 1. INTRODUCTION In a mechanism for scheduling on unrelated machines there are n jobs which should be assigned to m machines, where it takes machine i tj time units to process job i j (and this is also the cost machine i incurs to process job j). The processing times are private information of the machines. The load of machine i is the sum of processing times of the jobs i is assigned. The goal is to design a truthful mechanism which allocates the jobs such that the makespan, which is the maximal load over all machines, is minimized. A mechanism is truthful if it is a dominant strategy for every machine to report its true processing times. This problem has been introduced by Nisan and Ronen [1999]. Nisan and Ronen show that the VCG mechanism achieves an approximation ratio of m, and also show that no mechanism, even one with unlimited computational power, can guarantee an approximation ratio better than
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/vcg-is-the-best-anonymous-scheduling-mechanism-5PNuAPQQul
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
VCG is the best anonymous scheduling mechanism
Ashlagi, Itai; Dobzinski, Shahar; Lavi, Ron
Follow ACM SIGecom Exchanges
, Volume 8 (1)
Association for Computing Machinery – Jul 1, 2009
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
