Next Article in Journal
Solving Matrix Equations on Multi-Core and Many-Core Architectures
Next Article in Special Issue
On Stable Matchings and Flows
Previous Article in Journal
PMS6MC: A Multicore Algorithm for Motif Discovery
Previous Article in Special Issue
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
Open AccessArticle

Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists

Department of Computer Science and Engineering, Chalmers University of Technology, S-412 96 Göteborg, Sweden
Author to whom correspondence should be addressed.
Algorithms 2013, 6(4), 824-856;
Received: 21 June 2013 / Revised: 7 November 2013 / Accepted: 8 November 2013 / Published: 19 November 2013
(This article belongs to the Special Issue Special Issue on Matching under Preferences)
A key property of overlay networks is the overlay nodes’ ability to establish connections (or be matched) to other nodes by preference, based on some suitability metric related to, e.g., the node’s distance, interests, recommendations, transaction history or available resources. When there are no preference cycles among the nodes, a stable matching exists in which nodes have maximized individual satisfaction, due to their choices, however no such guarantees are currently being given in the generic case. In this work, we employ the notion of node satisfaction to suggest a novel modeling for matching problems, suitable for overlay networks. We start by presenting a simple, yet powerful, distributed algorithm that solves the many-to-many matching problem with preferences. It achieves that by using local information and aggregate satisfaction as an optimization metric, while providing a guaranteed convergence and approximation ratio. Subsequently, we show how to extend the algorithm in order to support and adapt to changes in the nodes’ connectivity and preferences. In addition, we provide a detailed experimental study that focuses on the levels of achieved satisfaction, as well as convergence and reconvergence speed. View Full-Text
Keywords: matching; overlay networks; distributed; adaptive matching; overlay networks; distributed; adaptive
Show Figures

Figure 1

MDPI and ACS Style

Georgiadis, G.; Papatriantafilou, M. Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists. Algorithms 2013, 6, 824-856.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Back to TopTop