Spanning network games.

DOI10.1007/S001820050085MaRDI QIDQ1972602zbMATH OpenOpenAlexFDO

Authors Daniel Granot, M. Maschler

Publication date 11 April 2000

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

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

zbMATH Keywords

cooperative gamescoredecompositionminimum cost spanning tree gamesnetworksnucleolus

Mathematics Subject Classification ID

Games involving graphs (91A43)

Recommendations

• Monotonic games are spanning network games
• Network strength games: the core and the nucleolus
• On the core of network synthesis games
• On the core and nucleolus of directed acyclic graph games

Cited in

(18)

• Operations research games: A survey. (With comments and rejoinder)
• Total balancedness condition for Steiner tree games.
• Strategic cooperation in cost sharing games
• Pricing traffic in a spanning network
• On the core of cost-revenue games: minimum cost spanning tree games with revenues
• Monotonic games are spanning network games
• A fair rule in minimum cost spanning tree problems
• A survey on networking games in telecommunications
• Finding the nucleoli of large cooperative games
• Cooperative networks games with elastic demands
• Power Indices in Spanning Connectivity Games
• Efficient black-box reductions for separable cost sharing
• Efficient black-box reductions for separable cost sharing
• On the core and nucleolus of directed acyclic graph games
• Michael Maschler's bibliography
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• Additivity in minimum cost spanning tree problems

This page was built for publication: Spanning network games.

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