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.
- Approachability principle
- Coalitional game theory