Stable families of coalitions and normal hypergraphs
type: Item
instance of: scholarly article
title: Stable families of coalitions and normal hypergraphs
zbMATH Open document ID: 0915.90277
DOI: 10.1016/S0165-4896(97)00007-3
author: Endre Boros
author: Vladimir Gurvich
author: Aleksandr A. Vasin
published in: Mathematical Social Sciences
publication date: 1999-04-27T00:00:00Z
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 1256854
zbMATH Keywords: cooperative game theory
zbMATH Keywords: TU-games
zbMATH Keywords: NTU-games
zbMATH Keywords: core
zbMATH Keywords: \({\mathcal K}\)-core
zbMATH Keywords: coalition
zbMATH Keywords: stable family of coalitions
zbMATH Keywords: characteristic function
zbMATH Keywords: generalized characteristic function
zbMATH Keywords: monotonicity
zbMATH Keywords: superadditivity
zbMATH Keywords: Bondareva-Shapley's theorem
zbMATH Keywords: Moulin-Peleg's theorem
zbMATH Keywords: Scarf's theorem
zbMATH Keywords: effectivity function
zbMATH Keywords: game form
zbMATH Keywords: perfect graph
zbMATH Keywords: normal hypergraph
Wikidata QID: Q59560873
MaRDI profile type: Publication
cites work: Q4863326
cites work: Q5615282
cites work: Q5734002
cites work: Q4708452
cites work: Perfect graphs are kernel solvable
cites work: Intermediate preferences and stable coalition structures
cites work: Strong Tiebout equilibrium under restricted preferences domain
cites work: Q3917914
cites work: Q3914792
cites work: Fractional kernels in digraphs
cites work: Necessary and sufficient conditions for stability of effectivity functions
cites work: Cores of partitioning games
cites work: Strongly balanced cooperative games
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: Cores of effectivity functions and implementation theory
cites work: Necessary and sufficient conditions for balancedness in partitioning games
cites work: The Core of an N Person Game
cites work: The assignment game. I: The core
description: scientific article; zbMATH DE number 1256854