Spanning network games.

DOI10.1007/s001820050085zbMath1058.91518OpenAlexW2169602646MaRDI QIDQ1972602

Michael Maschler, Daniel Granot

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 gamesdecompositionnetworkscorenucleolusminimum cost spanning tree games

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (17)

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

This page was built for publication: Spanning network games.