A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution (Q1069868): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0165-4896(86)90006-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079064676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of Convex Games Without Side Payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of the Kernel of a Cooperative Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel and bargaining set for convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex games without side payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138513 / rank
 
Normal rank

Latest revision as of 10:26, 17 June 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
    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
    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
    0 references