New efficiency results for makespan cost sharing

DOI10.1016/J.IPL.2008.01.005MaRDI QIDQ963402zbMATH OpenOpenAlexFDO

Authors Yvonne Bleischwitz, Florian Schoppmann

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)

Recommendations

• Cost Sharing Methods for Makespan and Completion Time Scheduling
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
• Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
• Fair cost-sharing methods for scheduling jobs on parallel machines
• Cost-sharing mechanisms for scheduling under general demand settings

Cites work

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

Cited in

(7)

• Fair cost-sharing methods for scheduling jobs on parallel machines
• Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
• Black-box reductions for cost-sharing mechanism design
• From cost sharing mechanisms to online selection problems
• Cost Sharing Methods for Makespan and Completion Time Scheduling
• Black-box reductions for cost-sharing mechanism design

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963402)