Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game

DOI10.1007/978-3-319-66700-3_22zbMATH Open1403.91257arXiv1707.01496OpenAlexW2732176327MaRDI QIDQ681886FDOQ681886

Authors: Nevzat Onur Domaniç, Chi-Kit Lam, C. G. Plaxton 

Publication date: 13 February 2018

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1707.01496

Recommendations

• Two-sided matching with indifferences
• Marriage, honesty, and stability
• On computing Pareto stable assignments
• A new approach to the Pareto stable matching problem
• Stable marriage and indifference

zbMATH Keywords

stable marriagegroup strategyproofnessgeneralized assignment gamePareto-stable matchings

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Matching models (91B68)

Cited In (4)

• Pareto stability in two-sided many-to-many matching with weak preferences
• Pareto efficient matchings with pairwise preferences
• Mechanisms for the Marriage and the Assignment Game
• Group stability in matching with interdependent values

This page was built for publication: Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681886)