A Cyclic Representation of Discrete Coordination Procedures
classification
💻 cs.MA
cs.DMcs.SYeess.SYmath.OC
keywords
cyclediscreteprocedureagentapproximatedasymptoticallycommunicationcoordination
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.