Cost allocation in spanning network enterprises with stochastic connection costs. (Q1811556)

This paper analyzes the problem of network formation and cost allocation that arises when customers need to be connected to a single service provider through a network and the cost of connections are stochastic. The author shows that how an `optimal' network is determined and the core of the corresponding stochastic spanning tree game is non-empty. For allocating the random costs of an optimal network, the author introduces a two stage bird allocation and shows that it results in a core allocation for stochastic spanning tree games. See also \textit{C. G. Bird} [Networks 6, 335--350 (1976; Zbl 0357.90083)].