On the number of blocks required to access the core

DOI10.1016/j.dam.2011.12.022zbMath1238.91018OpenAlexW2080609333MaRDI QIDQ423887

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

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.022

zbMATH Keywords

coreexcess functionDavis-Maschler reduced-gamedominance path

Mathematics Subject Classification ID

Cooperative games (91A12) Utility theory for games (91A30)

Related Items

On the characterizations of viable proposals ⋮ Accessibility and stability of the coalition structure core ⋮ Stability properties of the core in a generalized assignment problem ⋮ An optimal bound to access the core in TU-games ⋮ The equivalence of the minimal dominant set and the myopic stable set for coalition function form games

Cites Work

• Unnamed Item
• Unnamed Item
• Accessible outcomes versus absorbing outcomes
• The core can be accessed with a bounded number of blocks
• On the accessibility of the core
• On the reduced game property and its converse
• A characterization of the Shapley value in queueing problems
• A property of the core
• Core tâtonnement
• An Equilibrium-Point Interpretation of Stable Sets and a Proposed Alternative Definition
• The kernel of a cooperative game