= Minimum-cost spanning tree game
{wiki=Minimum-cost_spanning_tree_game}
The Minimum-Cost Spanning Tree Game is a concept in cooperative game theory that represents a scenario where players (or agents) must cooperate to achieve a common goal, which is to construct a minimum-cost spanning tree from a given graph. In this game: 1. **Graph Structure**: You have a graph with vertices (nodes) and edges (connections) that have associated costs. The goal is to connect all vertices so that the total cost of the edges used is minimized.
Back to article page
