| Article ID: | iaor201522240 |
| Volume: | 63 |
| Issue: | 3 |
| Start Page Number: | 231 |
| End Page Number: | 238 |
| Publication Date: | May 2014 |
| Journal: | Networks |
| Authors: | Okamoto Yoshio, Kobayashi Masayuki |
| Keywords: | game theory |
We give a necessary condition and a sufficient condition for a minimum‐cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum‐cost spanning tree games. We also discuss algorithmic issues.Copyrigh.