Next Article in Journal
Next Article in Special Issue
Previous Article in Journal
Previous Article in Special Issue
Algorithms 2013, 6(4), 824-856; doi:10.3390/a6040824
Article

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

*  and
Received: 21 June 2013; in revised form: 7 November 2013 / Accepted: 8 November 2013 / Published: 19 November 2013
(This article belongs to the Special Issue Special Issue on Matching under Preferences)
Download PDF [952 KB, uploaded 19 November 2013]
Abstract: 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.
Keywords: matching; overlay networks; distributed; adaptive matching; overlay networks; distributed; adaptive
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


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.

AMA Style

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

Chicago/Turabian Style

Georgiadis, Giorgos; Papatriantafilou, Marina. 2013. "Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists." Algorithms 6, no. 4: 824-856.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert