Application of Stable Marriage Algorithms and Cooperative Game Theory to the Building of Cloud Collaborations.
Key: Wen13-4
Author: Olga Wenge
Date: September 2013
Kind: In proceedings
Book title: Proceedings of the PhD Symposium at the 2nd European Conference on Service-Oriented and Cloud Computing (ESOCC 2013)
Keywords: cloud collaborations, cloud provider selection, stable marriage problem, cooperative game theory, cloud market supervision
Abstract: Today’s cloud environments are very heterogeneous. This cloud heterogeneity, as the consequence of lacking cloud standards, builds technical and security barriers between cloud providers and blocks them from intended cloud collaborations within cloud marketplaces. A cloud broker, who acts on behalf of cloud providers, matches compatible collaborative partners according to their requirements and attempts to support the optimal exchange of cloud resources between them. The cloud brokerage matchmaking process must also consider security aspects. The fulfillment of security requirements in cloud collaborations usually involves providing risk assessments, which are still very time-consuming. In our research we aim at the developing of appropriate optimal mechanisms for cloud provider selection for building cloud collaborations with respect to security requirements. In our paper, we present our initial ideas of the application of the cooperative game theory and stable marriage algorithms in order to provide a solution for proper cloud provider selection.
View Full paper (PDF) | Download Full paper (PDF)
Official URL

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.