Cost Sharing Methods for Makespan and Completion Time Scheduling
From MaRDI portal
Publication:3590973
DOI10.1007/978-3-540-70918-3_57zbMath1186.90049OpenAlexW1574583774MaRDI QIDQ3590973
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Combinatorial games (91A46)
Related Items
Beyond Moulin mechanisms, From Cost Sharing Mechanisms to Online Selection Problems, Black-box reductions for cost-sharing mechanism design, A complete characterization of group-strategyproof mechanisms of cost-sharing, New efficiency results for makespan cost sharing, Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems, Is Shapley Cost Sharing Optimal?, Cost sharing over combinatorial domains : Complement-free cost functions and beyond, Unnamed Item