Article ID Journal Published Year Pages File Type
1143303 Operations Research Letters 2007 11 Pages PDF
Abstract

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”.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Characterizations of the optimal stable allocation mechanism
Authors
, ,