Preemptive Coordination Mechanisms for Unrelated Machines
From MaRDI portal
Publication:2912822
DOI10.1007/978-3-642-33090-2_3zbMath1365.90131OpenAlexW242568591MaRDI QIDQ2912822
Publication date: 25 September 2012
Published in: Algorithms – ESA 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_3
Deterministic scheduling theory in operations research (90B35) Generalized Ramsey theory (05C55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ Coordination mechanisms for scheduling games with machine modification ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Designing cost-sharing methods for Bayesian games ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Dynamics of Profit-Sharing Games