The restricted core of games on distributive lattices: how to share benefits in a hierarchy
type: Item
instance of: scholarly article
title: The restricted core of games on distributive lattices: how to share benefits in a hierarchy
zbMATH Open document ID: 1216.49034
author: Lijue Xie
author: Michel Grabisch
published in: Mathematical Methods of Operations Research
publication date: 2011-05-05T00:00:00Z
full work available at URL: mmor09-2.pdf
Mathematics Subject Classification ID: 49N90
Mathematics Subject Classification ID: 93A13
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 5884560
zbMATH Keywords: cooperative game
zbMATH Keywords: feasible coalition
zbMATH Keywords: core
zbMATH Keywords: hierarchy
MaRDI profile type: Publication
OpenAlex ID: W1971033132
cites work: Cooperative games on antimatroids
cites work: Sharing a river.
cites work: Q2715704
cites work: Cooperative Games under Augmenting Systems
cites work: The core of games on convex geometries
cites work: Q5532570
cites work: Q4293522
cites work: Q4692885
cites work: Hierarchical organization structures and constraints on coalition formation
cites work: On the core of a collection of coalitions.
cites work: Cores of games with restricted cooperation
cites work: The Shapley value for cooperative games under precedence constraints
cites work: An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
cites work: Q4786439
cites work: Submodular functions and optimization.
cites work: A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
cites work: Games with permission structures: The conjunctive approach
cites work: Q5817872
cites work: The core of games on ordered structures and graphs
cites work: Games on lattices, multichoice games and the Shapley value: a new approach
cites work: A new approach to the core and Weber set of multichoice games
cites work: Shapley value for multichoice cooperative games. I
cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP
cites work: Graphs and Cooperation in Games
cites work: Cores of convex games
cites work: Component efficient solutions in line-graph games with applications
cites work: Lectures on Polytopes
DOI: 10.1007/S00186-010-0341-2
Recommended article: On the restricted cores and the bounded core of games on distributive lattices
Recommended article: Games on concept lattices: Shapley value and core
Recommended article: An axiomatization of the core of games with restricted cooperation
Recommended article: The bounded core for games with restricted cooperation
Recommended article: Ensuring the boundedness of the core of games with restricted cooperation
Recommended article: Cores of games with restricted cooperation
Recommended article: Characterization of the core in games with restricted cooperation
Recommended article: A lattice-theoretic approach to a class of dynamic games
Recommended article: Q3028756
description: scientific article; zbMATH DE number 5884560