Distributed payoff allocation in coalitional games via time varying paracontractions
Systems and Control
2019-12-02 v1 Computer Science and Game Theory
Systems and Control
Abstract
We present a partial operator-theoretic characterization of approachability principle and based on this characterization, we interpret a particular distributed payoff allocation algorithm to be a sequence of time-varying paracontractions. Further, we also propose a distributed algorithm, under the context of coalitional game, on time-varying communication networks. The state in the proposed algorithm converges to a consensus within, the predefined, desired set. For convergence analysis, we rely on the operator-theoretic property of paracontraction.
Cite
@article{arxiv.1911.12776,
title = {Distributed payoff allocation in coalitional games via time varying paracontractions},
author = {Aitazaz Ali Raja and Sergio Grammatico},
journal= {arXiv preprint arXiv:1911.12776},
year = {2019}
}