Submodularity of minimum-cost spanning tree games

DOI10.1002/net.21540zbMath1390.90170OpenAlexW2159574820MaRDI QIDQ4642487

Yoshio Okamoto, Masayuki Kobayashi

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21540

zbMATH Keywords

submodularitycost allocationcooperative gameconvex gameminimum-cost spanning tree game

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Cooperative games (91A12)

Related Items (3)

On the convexity of independent set games ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ An efficient characterization of submodular spanning tree games

This page was built for publication: Submodularity of minimum-cost spanning tree games