A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games
type: Item
instance of: scholarly article
title: A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games
zbMATH Open document ID: 1203.91206
author: Jun Wako
published in: Algorithmica
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 91B68
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5797158
zbMATH Keywords: matching problem
zbMATH Keywords: stable matching
zbMATH Keywords: von Neumann-Morgenstern stable set
MaRDI profile type: Publication
full work available at URL: s00453-010-9388-y
OpenAlex ID: W1969897216
cites work: The exchange-stable marriage problem
cites work: Von Neumann-Morgenstern stable sets in matching problems
cites work: College Admissions and the Stability of Marriage
cites work: Some remarks on the stable matching problem
cites work: Q3995616
cites work: An Equilibrium-Point Interpretation of Stable Sets and a Proposed Alternative Definition
cites work: Stable marriage assignment for unequal sets
cites work: A lattice fixed-point theorem with constraints
cites work: Subsolutions and the Supercore of Cooperative Games
cites work: Q3999327
cites work: On cores and indivisibility
cites work: Q5821521
DOI: 10.1007/S00453-010-9388-Y
description: scientific article; zbMATH DE number 5797158