Comparative cooperative game theory (Q922303): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convex games and extreme points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Management versus Ownership, I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entry and structures of interest groups in assignment games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of effectivity functions and implementation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of exact games. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative games with large cores / rank
 
Normal rank

Latest revision as of 11:40, 21 June 2024

scientific article
Language Label Description Also known as
English
Comparative cooperative game theory
scientific article

    Statements

    Comparative cooperative game theory (English)
    0 references
    0 references
    1990
    0 references
    This paper considers comparisons between two n-person cooperative games v and \(\hat v\) with and/or without sidepayments. Comparisons are made based on the criterion: whether or not, for each core imputation y of game v, there exists a core imputation x of game \(\hat v\) such that x Pareto dominates y. Two other variations of the criterion are given (the reviewer does not understand the motivation for these criteria). Then the paper gives certain properties of these criteria and shows that these criteria can be characterized for the classes of convex games and exact games. Also, the paper introduces the class of no-gap games, which is smaller than the class of exact games and is larger than the class of convex games. Some results for games with sidepayments hold for games without sidepayments.
    0 references
    0 references
    sidepayments
    0 references
    core imputation
    0 references
    convex games
    0 references
    exact games
    0 references
    no-gap games
    0 references
    0 references
    0 references