New efficiency results for makespan cost sharing
From MaRDI portal
Publication:963402
DOI10.1016/J.IPL.2008.01.005zbMATH Open1186.68057OpenAlexW2030947259MaRDI QIDQ963402FDOQ963402
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
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
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
- Hardness results for multicast cost sharing.
- New trade-offs in cost-sharing mechanisms
- Cost Sharing Methods for Makespan and Completion Time Scheduling
- Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
Cited In (7)
- From Cost Sharing Mechanisms to Online Selection Problems
- Black-box reductions for cost-sharing mechanism design
- Title not available (Why is that?)
- Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
- Fair cost-sharing methods for scheduling jobs on parallel machines
- Cost Sharing Methods for Makespan and Completion Time Scheduling
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)
