On the approachability principle for distributed payoff allocation in coalitional games
A.A. Raja (TU Delft - Team Sergio Grammatico)
S. Grammatico (TU Delft - Team Sergio Grammatico, TU Delft - Team Bart De Schutter)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In the context of coalitional games, we present a partial operator-theoretic characterization of the approachability principle and, based on this characterization, we interpret a particular distributed payoff allocation algorithm to be a sequence of time-varying paracontractions. Then, we also propose a distributed payoff allocation algorithm on time-varying communication networks. The state in the proposed algorithm converges to a consensus in the”CORE” set as desired. For the convergence analysis, we rely on an operator-theoretic property of paracontraction.
help_outline