Fair cost-sharing methods for scheduling jobs on parallel machines

DOI10.1016/j.jda.2009.02.001zbMath1164.90012OpenAlexW2073461965MaRDI QIDQ1026241

Burkhard Monien, Yvonne Bleischwitz

Publication date: 24 June 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2009.02.001

zbMATH Keywords

cross-monotonicitycost-sharing mechanismscost-sharing methodsgroup-strategyproofness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Cost-sharing mechanisms for scheduling under general demand settings ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness results for multicast cost sharing.
• Approximation and collusion in multicast cost sharing
• Incremental cost sharing: Characterization by coalition strategy-proofness
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• New Constructions of Mechanisms with Verification
• Bounds for Multifit Scheduling on Uniform Processors
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Applications of approximation algorithms to cooperative games
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms
• Automata, Languages and Programming
• Bounds on Multiprocessing Timing Anomalies
• STACS 2005
• Approximation and Online Algorithms
• Automata, Languages and Programming
• Automata, Languages and Programming
• Algorithmic mechanism design
• Sharing the cost of multicast transmissions

This page was built for publication: Fair cost-sharing methods for scheduling jobs on parallel machines