An optimal bound to access the core in TU-games (Q2435888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the number of blocks required to access the core / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel of a cooperative game / 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: Extendability and von neuman-morgenstern stability of the core / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core can be accessed with a bounded number of blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduced game property and its converse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Credible coalitions and the core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of exact games. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of the core / 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
Property / cites work
 
Property / cites work: On core stability, vital coalitions, and extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible outcomes versus absorbing outcomes / rank
 
Normal rank

Revision as of 08:48, 7 July 2024

scientific article
Language Label Description Also known as
English
An optimal bound to access the core in TU-games
scientific article

    Statements

    Identifiers