DocumentCode
678098
Title
A Game Theoretic Approach to Service Discovery and Selection
Author
Yi Chen ; Khoussainov, Bakh ; Xinfeng Ye
Author_Institution
Dept. of Comput. Sci., Auckland Univ., Auckland, New Zealand
fYear
2013
fDate
13-16 Oct. 2013
Firstpage
4072
Lastpage
4079
Abstract
The concept of cloud computing is changing the way that many industries conduct their businesses. In some industries, distributed resources are clustered together to form a cloud of services. Clients can establish business relationship with the service providers in a service cloud. In practice, businesses would like to build long term and stable business relationship with their business partners. In game theory, it is well known that, to build a stable relationship, both partners must benefit from the relationship. This paper proposed a game theoretic approach to solve the service selection problem. The scheme builds a custom reach ability game according to the business workflows and the business preferences of the client and the service provider. If a solution can be found in the game, it means (a) the functional requirements of the client is satisfied by the service provider, and (b) the business preferences of the client and the service provider can both be satisfied. That is, the client and the service provider can form a stable business relationship.
Keywords
business data processing; cloud computing; game theory; reachability analysis; business workflows; client business preferences; cloud computing; game theoretic approach; reachability game; service discovery; service provider; service selection; Cloud computing; Compounds; Game theory; Games; Industries; Materials; reachability game; service discovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics (SMC), 2013 IEEE International Conference on
Conference_Location
Manchester
Type
conf
DOI
10.1109/SMC.2013.695
Filename
6722448
Link To Document