Totally Balanced Flow Games Let be the flow game corresponding to a controlled capacitated network where all control games are dictatorial games (games of the form ıi, see Problem 20.4). Prove that...

Totally Balanced Flow Games

Let

be the flow game corresponding to a controlled capacitated network where all control games are dictatorial games (games of the form ıi, see Problem 20.4). Prove that each subgame

(where vS is the restriction of v to 2S) has a nonempty core, i.e., that the game

is totally balanced.