| Abstract |
In my presentation, I would like to discuss possible applications of the k-clique matching protocol. The protocol allows nodes in the network to form disjoint groups of a specific size based on the pairwise assessments of nodes fitness for such a group. The groups emerge directly from the local decisions of the nodes. After explaining the basics of the protocol and recent improvements to the protocol's scalability, I will present possible applications and would love to hear some great ideas from the audience, too. |