Stable cores in information graph games (Q2078082): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Noncooperative foundations of stable sets in voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability properties of the core in a generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence result for farsighted stable sets of games in characteristic function form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cost allocation for a spanning tree: A game theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal stable sets in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the von Neumann-Morgenstern stable set in a non-cooperative model of dynamic policy-making with a persistent agenda setter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex games and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets for asymmetric information economies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in matching problems with coalitional sovereignty and path dominance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farsighted stability in patent licensing: an abstract game approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extendability and von neuman-morgenstern stability of the core / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of information graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pillage games with multiple stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Neumann-Morgenstern solutions in the assignment market / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Farsighted Stable Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of vNM-stable sets for linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex vNM-stable sets for linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment games with stable core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair stable sets of simple games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new stable and more responsive cost sharing solution for minimum cost spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prosperty properties of TU-games / rank
 
Normal rank

Latest revision as of 04:03, 28 July 2024

scientific article
Language Label Description Also known as
English
Stable cores in information graph games
scientific article

    Statements

    Stable cores in information graph games (English)
    0 references
    0 references
    0 references
    25 February 2022
    0 references
    0 references
    information graph game
    0 references
    core
    0 references
    stable set
    0 references
    cycle-complete graph
    0 references
    0 references
    0 references