We define a framework for stable matching problems where agents are allowed to express their preferences in a compact way, via fuzzy constraints over the features describing the agents of the other group. We provide a solving engine for this new kind of stable matching problems that does not increase the time complexity of the classical GS algorithm, while maintaining stability of the matching returned. We then evaluate the approach experimentally.
Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems
PINI, MARIA SILVIA;ROSSI, FRANCESCA;
2017
Abstract
We define a framework for stable matching problems where agents are allowed to express their preferences in a compact way, via fuzzy constraints over the features describing the agents of the other group. We provide a solving engine for this new kind of stable matching problems that does not increase the time complexity of the classical GS algorithm, while maintaining stability of the matching returned. We then evaluate the approach experimentally.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
