Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems
type: Item
instance of: scholarly article
title: Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems
zbMATH Open document ID: 1254.90198
author: Noriyoshi Sukegawa
author: Yoshitsugu Yamamoto
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91B08
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 6119223
zbMATH Keywords: stable matching
zbMATH Keywords: Gale-Shapley algorithm
zbMATH Keywords: preference profile
zbMATH Keywords: strategic manipulability
zbMATH Keywords: rooted spanning tree
zbMATH Keywords: matroid intersection
MaRDI profile type: Publication
full work available at URL: s13160-012-0077-x
OpenAlex ID: W1969990055
cites work: Q5668821
cites work: A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
cites work: Efficient algorithms for a family of matroid intersection problems
cites work: College Admissions and the Stability of Marriage
cites work: Q3995616
cites work: Cheating strategies for the Gale-Shapley algorithm with complete preference lists
cites work: Q3048571
cites work: Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications
DOI: 10.1007/S13160-012-0077-X
description: scientific article; zbMATH DE number 6119223