A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution (Q1069868): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution |
scientific article |
Statements
A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution (English)
0 references
1986
0 references
It is proved that the core of an ordinal convex game is a von Neumann- Morgenstern solution. The proof makes a strong use of reduced games of cooperative games without side payments.
0 references
core
0 references
ordinal convex game
0 references
von Neumann-Morgenstern solution
0 references
reduced games
0 references
cooperative games without side payments
0 references
