A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games |
scientific article; zbMATH DE number 5797158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games |
scientific article; zbMATH DE number 5797158 |
Statements
A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (English)
0 references
7 October 2010
0 references
matching problem
0 references
stable matching
0 references
von Neumann-Morgenstern stable set
0 references
0 references
