Inner product spaces for MinSum coordination mechanisms

DOI10.1145/1993636.1993708zbMath1288.90025arXiv1010.1886OpenAlexW2065827889MaRDI QIDQ5419124

Vasilis Gkatzelis, José R. Correa, Neil Olver, Vahab S. Mirrokni, Richard John Cole

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.1886

zbMATH Keywords

schedulingapproximation algorithmprice of anarchycoordination mechanisms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (16)

Optimal cost sharing for capacitated facility location games ⋮ Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Coordination mechanisms for parallel machine scheduling ⋮ \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games ⋮ Tight bounds for the price of anarchy and stability in sequential transportation games ⋮ Inefficiency of games with social context ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Designing cost-sharing methods for Bayesian games ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ Congestion games with priority-based scheduling ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Truthfulness for the Sum of Weighted Completion Times

This page was built for publication: Inner product spaces for MinSum coordination mechanisms