Mohammad Mehedi Hassan, Eui-Nam Huh, Journal of Internet Computing and Services, Vol. 11, No. 5, pp. 105-118, Oct. 2010
Full Text:  HTML
Keywords: Dynamic cloud collaboration, Group bidding price, Profit sharing and cooperative game theory

Abstract

In recent years, dynamic collaboration (DC) among cloud providers (CPs) is becoming an inevitable approach for the widely use of cloud computing and to realize the greatest value of it. In our previous paper, we proposed a combinatorial auction (CA) based cloud market model called CACM that enables a DC platform among different CPs. The CACM model allows any CP to dynamically collaborate with suitable partner CPs to form a group before joining an auction and thus addresses the issue of conflicts minimization that may occur when negotiating among providers. But how to determine optimal group bidding prices, how to obtain the stability condition of the group and how to distribute the winning prices/profits among the group members in the CACM model have not been studied thoroughly. In this paper, we propose to formulate the above problems of cooperative negotiation in the CACM model as a bankruptcy game which is a special type of N-person cooperative game. The stability of the group is analyzed by using the concept of the core and the amount of allocationsto each member of the group is obtained by using Shapley value. Numerical results are presented to demonstrate the behaviors of the proposed approaches.

Statistics
Cite this article