A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-010-9388-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969897216 / rank | |||
Normal rank | |||
Revision as of 19:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games |
scientific article |
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
