Cost Sharing Methods for Makespan and Completion Time Scheduling

DOI10.1007/978-3-540-70918-3_57MaRDI QIDQ3590973zbMATH OpenOpenAlexFDO

Authors Janina A. Brenner, Guido Schäfer

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_57

zbMATH Keywords

combinatorial optimizationgame theorymechanism designscheduling problemscost sharing mechanisms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Combinatorial games (91A46)

Recommendations

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

Cited in

(12)

• New efficiency results for makespan cost sharing
• Black-box reductions for cost-sharing mechanism design
• Beyond Moulin mechanisms
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
• 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 in a job scheduling problem
• Black-box reductions for cost-sharing mechanism design
• Is Shapley Cost Sharing Optimal?
• From cost sharing mechanisms to online selection problems
• Cost sharing over combinatorial domains : Complement-free cost functions and beyond

This page was built for publication: Cost Sharing Methods for Makespan and Completion Time Scheduling

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