Peer Matcher: Decentralized Partnership Formation

Abstract—This paper presents PeerMatcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pairwise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, PeerMatcher 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 peerto-peer communication. An extensive evaluation of PeerMatcher demonstrates its accuracy, efficiency, and scalability.

• Type: Journal
• Year: 2015
• Where: SASO
• Authors: Nicolae Vladimir Bozdog, Spyros Voulgaris, Henri E. Bal, Aart van Halteren
• Keywords: Control Systems, SASO 2015