| Article ID: | iaor2012206 |
| Volume: | 73 |
| Issue: | 1 |
| Start Page Number: | 161 |
| End Page Number: | 166 |
| Publication Date: | Jan 2012 |
| Journal: | Automation and Remote Control |
| Authors: | Agaev R, Chebotarev P |
| Keywords: | graphs |
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.