TY - JOUR
T1 - k -core covers and the core
AU - Sanchez-Rodriguez, E.
AU - Borm, P.
AU - Estevez Fernandez, M.A.
AU - Fiestras-Janeiro, M.G.
AU - Mosquera, M.A.
N1 - April 2015, Volume 81, Issue 2, pp 147-167
PY - 2015
Y1 - 2015
N2 - This paper extends the notion of individual minimal rights for a transferable utility game (TU-game) to coalitional minimal rights using minimal balanced families of a specific type, thus defining a corresponding minimal rights game. It is shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper introduces the notion of the $$k$$k-core cover as an extension of the core cover. The $$k$$k-core cover of a TU-game consists of all efficient payoff vectors for which the total joint payoff for any coalition of size at most $$k$$k is bounded from above by the value of this coalition in the corresponding dual game, and from below by the value of this coalition in the corresponding minimal rights game. It is shown that the core of a TU-game with player set $$N$$N coincides with the largest integer below or equal to $$\frac{|N|}{2}$$|N|2-core cover. Furthermore, full characterizations of games for which a $$k$$k-core cover is nonempty and for which a $$k$$k-core cover coincides with the core are provided.
AB - This paper extends the notion of individual minimal rights for a transferable utility game (TU-game) to coalitional minimal rights using minimal balanced families of a specific type, thus defining a corresponding minimal rights game. It is shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper introduces the notion of the $$k$$k-core cover as an extension of the core cover. The $$k$$k-core cover of a TU-game consists of all efficient payoff vectors for which the total joint payoff for any coalition of size at most $$k$$k is bounded from above by the value of this coalition in the corresponding dual game, and from below by the value of this coalition in the corresponding minimal rights game. It is shown that the core of a TU-game with player set $$N$$N coincides with the largest integer below or equal to $$\frac{|N|}{2}$$|N|2-core cover. Furthermore, full characterizations of games for which a $$k$$k-core cover is nonempty and for which a $$k$$k-core cover coincides with the core are provided.
UR - https://www.scopus.com/pages/publications/84940003809
UR - https://www.scopus.com/inward/citedby.url?scp=84940003809&partnerID=8YFLogxK
U2 - 10.1007/s00186-014-0490-9
DO - 10.1007/s00186-014-0490-9
M3 - Article
SN - 1432-2994
VL - 81
SP - 147
EP - 167
JO - Mathematical Methods of Operations Research
JF - Mathematical Methods of Operations Research
IS - 2
ER -