Online Mechanism Design for Cloud Computing

Download Now
Provided by: Tsihai
Topic: Cloud
Format: PDF
In this paper, the authors study the problem of online mechanism design for Resources Allocation and Pricing in Cloud Computing (RAPCC). They show that in general the allocation problems in RAPCC are NP-hard, and therefore they focus on designing Dominant-Strategy Incentive Compatible (DSIC) mechanisms with good competitive ratios compared to the offline optimal allocation (with the prior knowledge about the future jobs). They propose two kinds of DSIC online mechanisms. The first mechanism, which is based on a greedy allocation rule and leverages a priority function for allocation, is very fast and has a tight competitive bound.
Download Now

Find By Topic