Supply-Demand Matching in Non-Cooperative Social Networks

The complex supply-demand matching problem is a kind of social service computing problem, which can be applied to the coordinated production of products or the supply of service. In this scenario, the demander needs a number of suppliers to provide services or products to complete a given task. The key to solving this problem is to build a supply network that covers the requester's requirement. Traditional collaboration issues in social network mainly focused on the “team formation problem”, that is to build a team that covers all the skills required for the task. However, due to the complex characteristics of supply-demand matching problems in the application of social services, the team formation method is limited and inefficient, and there is no special solution for the complex supply-demand matching problems in social network. This paper proposes a general framework to solve the complex matching problem of supply and demand. On the premise of non-cooperative constraints, social networks are used to build supply networks with low communication loss, and the unnecessary cost is reduced through cooperation.