Spanning tree games The following figure depicts a network of roads connecting the capital city, Washington, with three nearby towns, Bethesda, Silver Spring, and McLean.
The towns are responsible for maintaining the roads between themselves and the capital. The maintenance cost of every segment of road is listed as a unit.
In the figure, a large dot indicates a vertex at which a town is located, and a small dot indicates a vertex at which no town is located.
Define c(S) as the minimal cost required for all the towns in coalition S to be connected with the capital. Write down the coalitional function.
