Provided by: VLD Digital
Date Added: Aug 2013
Generalized matching problems arise in a number of applications, including computational advertising, recommender systems, and trade markets. Consider, for example, the problem of recommending multimedia items (e.g., DVDs) to users such that users are recommended items that they are likely to be interested in, every user gets neither too few nor too many recommendations, and only items available in stock are recommended to users. State-of-the-art matching algorithms fail at coping with large real-world instances, which may involve millions of users and items.