arXiv Open Access 2011

A Cyclic Representation of Discrete Coordination Procedures

Rafig Agaev Pavel Chebotarev
Lihat Sumber

Abstrak

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.

Penulis (2)

R

Rafig Agaev

P

Pavel Chebotarev

Format Sitasi

Agaev, R., Chebotarev, P. (2011). A Cyclic Representation of Discrete Coordination Procedures. https://arxiv.org/abs/1112.0404

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2011
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓