Games on concept lattices: Shapley value and core

DOI10.1016/j.dam.2015.08.004zbMath1334.91008OpenAlexW2288665808MaRDI QIDQ897583

Ulrich Faigle, Manuel Ordóñez, Michel Grabisch, Andrés Jiménez-Losada

Publication date: 7 December 2015

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

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

zbMATH Keywords

Shapley valuecorecooperative gameconcept latticerestricted cooperation

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (5)

Remarkable polyhedra related to set functions, games and capacities ⋮ Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures ⋮ Unnamed Item ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis

Cites Work

• A discrete Choquet integral for ordered systems
• Monge extensions of cooperation and communication structures
• The Shapley value for cooperative games under precedence constraints
• Cooperative games with coalition structures
• The position value for union stable systems
• The presence of lattice theory in discrete problems of mathematical social sciences. Why.
• The Shapley value on convex geometries
• The core of games on convex geometries
• Cooperative games on antimatroids
• Hierarchical organization structures and constraints on coalition formation
• On the core of a collection of coalitions.
• Graphs and Cooperation in Games
• Cores of games with restricted cooperation
• The core of games on ordered structures and graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Games on concept lattices: Shapley value and core