| Article ID: | iaor20082771 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 3 |
| Start Page Number: | 392 |
| End Page Number: | 402 |
| Publication Date: | May 2007 |
| Journal: | Operations Research Letters |
| Authors: | Baou Mourad, Balinski Michel |
The stable allocation problem is the generalization of (0,1)-matching problems to the allocation of real numbers (hours or quantities) between two separate sets of agents. The same unique-optimal matching (for one set of agents) is characterized by each of three properties: ‘efficiency’, ‘monotonicity’, and ‘strategy-proofness’.