A Cyclic Representation of Discrete Coordination Procedures
Multiagent Systems
2012-02-07 v2 Discrete Mathematics
Systems and Control
Optimization and Control
Abstract
We show that any discrete opinion pooling procedure with positive weights can be asymptotically approximated by DeGroot's procedure whose communication digraph is a Hamiltonian cycle with loops. In this cycle, the weight of each arc (which is not a loop) is inversely proportional to the influence of the agent the arc leads to.
Cite
@article{arxiv.1112.0404,
title = {A Cyclic Representation of Discrete Coordination Procedures},
author = {Rafig Agaev and Pavel Chebotarev},
journal= {arXiv preprint arXiv:1112.0404},
year = {2012}
}
Comments
6 pages, 1 figure