New efficiency results for makespan cost sharing

DOI10.1016/j.ipl.2008.01.005zbMath1186.68057OpenAlexW2030947259MaRDI QIDQ963402

Florian Schoppmann, Yvonne Bleischwitz

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.005

zbMATH Keywords

schedulingmechanism designcost-sharingcross-monotonicity

Mathematics Subject Classification ID

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

Related Items (3)

From Cost Sharing Mechanisms to Online Selection Problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Unnamed Item

Cites Work

• Hardness results for multicast cost sharing.
• Incremental cost sharing: Characterization by coalition strategy-proofness
• New trade-offs in cost-sharing mechanisms
• Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
• Cost Sharing Methods for Makespan and Completion Time Scheduling
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: New efficiency results for makespan cost sharing