"Almost stable" matchings in the Roommates problem with bounded preference lists (2012)
Attributed to:
MATCH-UP: Matching Under Preferences - Algorithms and Complexity
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.tcs.2012.01.022
Publication URI: http://dx.doi.org/10.1016/j.tcs.2012.01.022
Type: Journal Article/Review
Parent Publication: Theoretical Computer Science