On the core of information graph games

DOI10.1007/BF01240149MaRDI QIDQ2366097zbMATH OpenFDO

Authors J. Kuipers

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1007/BF01240149

zbMATH Keywords

information graph gamesminimum cost spanning tree games

Mathematics Subject Classification ID

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

Recommendations

• Stable cores in information graph games
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES
• The irreducible Core of a minimum cost spanning tree game
• On the core and nucleolus of directed acyclic graph games

Cites work

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

Cited in

(11)

• Cost sharing on prices for games on graphs
• Stable cores in information graph 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
• On the set of extreme core allocations for minimal cost spanning tree problems
• Lexicographic allocations and extreme core payoffs: the case of assignment games
• The P-value for cost sharing in minimum
• On the core and nucleolus of directed acyclic graph games
• Comparative statics of minimum-cost-spanning-tree games
• Assignment games satisfy the CoMa-property
• Cost allocation games with information costs.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366097)