  We study the variant of the stable marriage problem in which the preferences
of the agents are allowed to include indifferences. We present a mechanism for
producing Pareto-stable matchings in stable marriage markets with indifferences
that is group strategyproof for one side of the market. Our key technique
involves modeling the stable marriage market as a generalized assignment game.
We also show that our mechanism can be implemented efficiently. These results
can be extended to the college admissions problem with indifferences.
