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

decompositionnetworkscooperative gamescorenucleolusminimum cost spanning tree games

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

(17)

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

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)