A truthful mechanism for value-based scheduling in cloud computing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A unified approach to approximating resource allocation and scheduling
- Algorithmic Game Theory
- Algorithmic mechanism design (extended abstract)
- Approximating the throughput of multiple machines in real-time scheduling
- Bayesian algorithmic mechanism design
- Bayesian incentive compatibility via fractional assignments
- Bayesian incentive compatibility via matchings
- On the limits of black-box reductions in mechanism design
- Truthful mechanisms with implicit payment computation
Cited in
(10)- A performance-based scheme for pricing resources in the cloud
- An approximate bribe queueing model for bid advising in cloud spot markets
- A truthful mechanism for value-based scheduling in cloud computing
- Flexible resource allocation to interval jobs
- A truthful mechanism for interval scheduling
- Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems
- Preemptible queues with advance reservations: strategic behavior and revenue management
- Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game
- Simple pricing schemes for the cloud
- Truthful mechanism design for bin packing with applications on cloud computing
This page was built for publication: A truthful mechanism for value-based scheduling in cloud computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678764)