Submodularity of minimum-cost spanning tree games

DOI10.1002/NET.21540MaRDI QIDQ4642487zbMATH OpenOpenAlexFDO

Authors Masayuki Kobayashi, Yoshio Okamoto

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

convex gamecooperative gamecost allocationminimum-cost spanning tree gamesubmodularity

Mathematics Subject Classification ID

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

Recommendations

• Minimum cost spanning tree games and population monotonic allocation schemes.
• Generalized minimum spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• An efficient characterization of submodular spanning tree games
• Multi-criteria minimum cost spanning tree games

Cited in

(14)

• Minimum cost spanning tree games and population monotonic allocation schemes.
• Submodularity of some classes of the combinatorial optimization games
• On the core of cost-revenue games: minimum cost spanning tree games with revenues
• Monotonic games are spanning network games
• On the convexity of independent set games
• Generalized minimum spanning tree games
• scientific article; zbMATH DE number 5666824 (Why is no real title available?)
• Proof of permutationally convexity of MCSF games
• Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
• The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
• An efficient characterization of submodular spanning tree games
• An efficient characterization of submodular spanning tree games
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems
• A branch-and-cut algorithm for submodular interdiction games

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

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