Track:
All Papers
Downloads:
Abstract:
The desk-mates matcher application places students in pairs of two for working in projects (similar to the well known problems of stable matchings or stable roommates). Each of the students has a (hopefully stable) secret preference between every two colleagues. The participants want to find an allocation satisfying their secret preferences and without leaking any of these secret preferences, except for what a participant can infer from the identity of the partner that was recommended to her.