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 teacher, 'b' can represent a student, 'c' can represent content provider such as a biology textbook and 'd' can represent a classroom or building.
Similarly 'a1' represents teacher1, 'a2' represents teacher2, etc.
Usefulness of the model:
1) Prediction: One can make a prediction using the model, to select the best subgraph or services for an individual. Entrepreneurs can use the data to set up new nodes, based on the require…
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 teacher, 'b' can represent a student, 'c' can represent content provider such as a biology textbook and 'd' can represent a classroom or building.
Similarly 'a1' represents teacher1, 'a2' represents teacher2, etc.
Usefulness of the model:
1) Prediction: One can make a prediction using the model, to select the best subgraph or services for an individual. Entrepreneurs can use the data to set up new nodes, based on the require…