An optimal bound to access the core in TU-games

DOI10.1016/J.GEB.2013.02.008MaRDI QIDQ2435888zbMATH OpenOpenAlexFDO

Authors Sylvain Béal, Eric Rémila, Philippe Solal

Publication date 21 February 2014

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.geb.2013.02.008

zbMATH Keywords

accessibilitycoreoptimal boundTU-gamesweak dominance

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Cooperative games (91A12)

Recommendations

• An optimal bound to access the core in TU-games
• The core can be accessed with a bounded number of blocks
• On the number of blocks required to access the core
• On the accessibility of the core
• On the accessibility of core-extensions

Cites work

• A property of the core
• Accessible outcomes versus absorbing outcomes
• Cooperative games with large cores
• Cores of convex games
• Cores of exact games. I
• Credible coalitions and the core
• Extendability and von neuman-morgenstern stability of the core
• scientific article; zbMATH DE number 3543876 (Why is no real title available?)
• scientific article; zbMATH DE number 863499 (Why is no real title available?)
• On core stability, vital coalitions, and extendability
• On the number of blocks required to access the core
• On the reduced game property and its converse
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• The core can be accessed with a bounded number of blocks
• The kernel of a cooperative game

Cited in

(12)

• The equivalence of the minimal dominant set and the myopic stable set for coalition function form games
• Stability properties of the core in a generalized assignment problem
• Accessibility and stability of the coalition structure core
• scientific article; zbMATH DE number 1371520 (Why is no real title available?)
• On the number of blocks required to access the core
• An optimal bound to access the core in TU-games
• Attraction of the core and the cohesion flow
• On the accessibility of core-extensions
• On the characterizations of viable proposals
• The core can be accessed with a bounded number of blocks
• On the accessibility of the core
• The unit-level-core for multi-choice games: the replicated core for TU games

This page was built for publication: An optimal bound to access the core in TU-games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435888)