NORMA eResearch @NCI Library

Preference-Based Resource Allocation: Using Heuristics to Solve Two-Sided Matching Problems with Indifferences

Haas, Christian, Kimbrough, Steven O. , Caton, Simon and Weinhardt, Christof (2013) Preference-Based Resource Allocation: Using Heuristics to Solve Two-Sided Matching Problems with Indifferences. In: Economics of Grids, Clouds, Systems, and Services. Lecture Notes in Computer Science (8193). Springer International Publishing, Springer International Publishing Switzerland, pp. 149-160. ISBN 9783319024141

Full text not available from this repository.
Official URL:


The allocation of resources between providers to consumers is a well-known problem and has received significant attention, typically using notions of monetary exchanges. In this paper, we study resource matching in settings without monetary transactions by using a two-sided matching approach, e.g., in social and collaborative environments where users define preferences for with whom they may be matched. Whereas two-sided matching for strict and complete preference rankings (i.e., without indifferences) has been extensively studied, it is known that the matching problem is NP-hard for more realistic preference structures. We study, via simulation, the applicability of a heuristic procedure in settings with indiffernces in preferences, and compare its performance to existing algorithms. We study performance metrics like fairness and welfare in addition to the classic stability objective. Our results show interesting trade-offs between performance metrics and promising performance of the heuristic.

Item Type: Book Section
Subjects: Q Science > QA Mathematics > Electronic computers. Computer science
T Technology > T Technology (General) > Information Technology > Electronic computers. Computer science
Divisions: School of Computing > Staff Research and Publications
Depositing User: Caoimhe Ní Mhaicín
Date Deposited: 30 Oct 2014 15:12
Last Modified: 30 Oct 2014 15:12

Actions (login required)

View Item View Item