On the core of information graph games

DOI10.1007/BF01240149zbMath0801.90149MaRDI QIDQ2366097

Jeroen Kuipers

Publication date: 29 June 1993

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

minimum cost spanning tree gamesinformation graph games

Mathematics Subject Classification ID

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

Related Items (7)

On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Lexicographic allocations and extreme core payoffs: the case of assignment games ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ Enforcing fair cooperation in production-inventory settings with heterogeneous agents ⋮ Assignment games satisfy the CoMa-property ⋮ The \(P\)-value for cost sharing in minimum ⋮ Stable cores in information graph games

Cites Work

• On the core and nucleolus of minimum cost spanning tree games
• Minimum cost spanning tree games
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On the core of information graph games