A lower bound for scheduling mechanisms

DOI10.1007/s00453-008-9165-3zbMath1183.68105MaRDI QIDQ1031874

George Christodoulou, Elias Koutsoupias, Angelina Vidali

Publication date: 23 October 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9165-3

zbMATH Keywords

lower bound; algorithmic mechanism design; scheduling unrelated machines

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Distributed algorithmic mechanism design for scheduling on unrelated machines, The price of envy-freeness in machine scheduling, Mechanisms for scheduling with single-bit private values, A lower bound of \(1+\varphi \) for truthful scheduling mechanisms, Mechanism design with a restricted action space, A Unified Approach to Truthful Scheduling on Related Machines, Recent Developments in the Mechanism Design Problem for Scheduling, The VCG Mechanism for Bayesian Scheduling

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity
• Algorithmic mechanism design (extended abstract)
• Approximation techniques for utilitarian mechanism design
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Optimal Auction Design
• Mechanism Design for Fractional Scheduling on Unrelated Machines
• Algorithms – ESA 2005
• STACS 2005
• Truthful randomized mechanisms for combinatorial auctions
• Algorithmic mechanism design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item