The Competitive Collaboration Algorithm
Competitive Collaboration Algorithm: It's a decentralized network where you compete to collaborate. Edge weight represents difficulty to get connected. Difficulty depends on factors such as distance, location, quality, price. We need to choose subgraph containing all the required nodes (e.g. nodes containing a,b,c,d ) that has a minimum weight or optimal weight. a,b,c,d can represent different services, whereas a1, a2 represents the same services from a different service provider. For example, 'a' can represent a student, 'b' can represent a teacher, 'c' can represent content provider such as a biology textbook and 'd' can represent a classroom or building. Similarly 'b1' represents teacher1, 'b2' represents teacher2, etc. So, For student1 (a1), the optimum subgraph or subgraph with minimum weight containing all the required services are a1,b1,c2, d2 with weight 0.5+2.3+4.2 . Usefulness of the model: 1) Predictio...