  In this paper, we consider a sequence of transferable utility (TU)
coalitional games where the coalitional values are unknown but vary within
certain bounds. As a solution to the resulting family of games, we formalise
the notion of "robust CORE". Our main contribution is to design two distributed
algorithms, namely, distributed payoff allocation and distributed bargaining,
that converge to a consensual payoff distribution in the robust CORE. We adopt
an operator-theoretic perspective to show convergence of both algorithms
executed on time-varying communication networks. An energy storage optimization
application motivates our framework for "robust coalitional games".
