Stable Allocation of Services in Public Cloud Manufacturing Platforms: A Game Theory View

Abstract

With unbounding the manufacturing resources and capabilities from shopfloors and being available as on-demand services for everyone who needs, the service allocation problem becomes critical. Despite of private Cloud Manufacturing platforms in which the service allocation problem is an optimization matching problem, in public Cloud Manufacturing platforms the service allocation problem is a matching game between manufacturing providers and consumers. This is a complex form of games that has two sides, one side is the players that has manufacturing resources and capabilities and the other side is the players who want to receives such services. In this paper, we present a matching game model for public Cloud Manufacturing platforms, and discusses the stable solution of the game using Deferred Acceptance algorithm. Then, we examine the model using a case study from automotive spare parts manufacturing in Iran which was the main motivation of this study. The novelty of the contribution of this paper is in development of a stable and optimal matching mechanism for public platforms.