Stable Matching Games: Manipulation via Subgraph Isomorphism
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0382-5
Abstract: In this paper we consider a problem that arises from a strategic issue in the stable matching model (with complete preference lists) from the viewpoint of exact-exponential time algorithms. Specifically, we study the Stable Extension… read more here.
Keywords: subgraph isomorphism; preference lists; time; stable matching ... See more keywords