A truthful mechanism for value-based scheduling in cloud computing

DOI10.1007/s00224-013-9449-0zbMath1380.68075OpenAlexW2057239927MaRDI QIDQ1678764

Jonathan Yaniv, Ishai Menache, Navendu Jain, Joseph (Seffi) Naor

Publication date: 7 November 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9449-0

zbMATH Keywords

resource allocationapproximation algorithmsmechanism designscheduling algorithmscloud computing

Mathematics Subject Classification ID

Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Internet topics (68M11)

Related Items

Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems ⋮ Flexible resource allocation to interval jobs ⋮ Preemptible queues with advance reservations: strategic behavior and revenue management

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Truthful Mechanisms with Implicit Payment Computation
• Algorithmic mechanism design (extended abstract)
• Bayesian algorithmic mechanism design
• On the limits of black-box reductions in mechanism design
• Algorithmic Game Theory
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: A truthful mechanism for value-based scheduling in cloud computing