  Given a player is guaranteed the same payoff for each delivery path in a
single-cube delivery network, the player's best response is to randomly divide
all goods and deliver them to all other nodes, and the best response satisfies
the Kuhn-Tucker condition. The state of the delivery network is randomly
complete. If congestion costs are introduced to the player's maximization
problem in a multi-cubic delivery network, the congestion paradox arises where
all coordinates become congested as long as the previous assumptions about
payoffs are maintained.
