![]() | Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incompDocID: 1qVmN - View Document |
![]() | Matching with Preferences over Colleagues Solves Classical Matching Scott Duke Kominers∗,1 Department of Economics, Harvard University and Harvard Business School AbstractDocID: 1fujJ - View Document |
![]() | CCCG 2010, Winnipeg MB, August 9–11, 2010 Stable Roommates and Geometric Spanners Paz Carmi∗ AbstractDocID: 18sU0 - View Document |
![]() | Friendship and Stable Matching∗ Elliot Anshelevich† Onkar Bhardwaj‡ Martin Hoefer§DocID: 110X3 - View Document |
![]() | THE ROOMMATES PROBLEM DISCUSSED NATHAN SCHULZDocID: 3nlx - View Document |