A dynamic strategy-proof algorithm for allocation and pricing of cloud services Online publication date: Thu, 01-Aug-2019
by Temidayo Oluwatosin Omotehinwa; Joseph Shuaibu Sadiku
International Journal of Cloud Computing (IJCC), Vol. 8, No. 2, 2019
Abstract: In this paper, we present a dynamic strategy-proof algorithm for allocation and pricing. The algorithm relies on market history to forecast a benchmark price to ensure truthful valuation from the market participants. The algorithm also ensures that the utility is evenly distributed between buyer and seller. The utility is the difference between the buyer's maximum offer and the seller's minimum acceptable price. The results of the experimental studies carried out shows that: 1) the budget limits of the buyers with successful allocations were not exceeded; 2) only market participants with truthful offers and bids were allocated services; 3) the utility is higher when there is no strategy-proof for preventing overbid and that there is at least a 50% increase in price per unit when there is no strategy-proof to prevent overbid; 4) in terms of computational efficiency, the algorithm converges in polynomial time with a worst-case running time of O(n2).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Cloud Computing (IJCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook