Article ID Journal Published Year Pages File Type
419267 Discrete Applied Mathematics 2016 4 Pages PDF
Abstract

In this short note the many-to-many stable matching and stable allocation problems are revisited. A confusion concerning preferences, efficiency, monotonicity and strategy-proofness is clarified without rewriting new proofs.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A note on many-to-many matchings and stable allocations
Authors
,