Payoff distribution in robust coalitional games on time-varying networks

In this article, we consider a sequence of transferable utility coalitional games, where the actual coalitional values are unknown but vary within known bounds. As a solution to the resulting family of games, we formalize the notion of 'robust core.' Our main contribution is to design two distributed algorithms, namely 1) distributed payoff allocation and 2) distributed bargaining, which 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.'Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Team Sergio GrammaticoTeam Bart De Schutte