Peer Matcher: Decentralized Partnership Formation

Abstract

This paper presents Peer Matcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pair wise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, Peer Matcher employs a novel set of heuristics that aim at converging to the optimal grouping while keeping the associated time and computational complexity low. A key feature is the use of peer-to-peer communication. An extensive evaluation of Peer Matcher demonstrates its accuracy, efficiency, and scalability.