Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling

DOI10.1007/978-3-319-71924-5_6zbMath1405.91015OpenAlexW2770378309MaRDI QIDQ4614059

Ioannis Caragiannis, Cosimo Vinci, Vasilis Gkatzelis

Publication date: 30 January 2019

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-71924-5_6

zbMATH Keywords

machine schedulingcoordination mechanismShapley-value-based cost-sharing protocols

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium ⋮ Unnamed Item ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ Scheduling games with machine-dependent priority lists ⋮ Congestion games with priority-based scheduling ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Cost-sharing games in real-time scheduling systems ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

This page was built for publication: Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling