A Cyclic Representation of Discrete Coordination Procedures

Computer Science – Multiagent Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 1 figure

Scientific paper

10.1134/S0005117912010134

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Cyclic Representation of Discrete Coordination Procedures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Cyclic Representation of Discrete Coordination Procedures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Cyclic Representation of Discrete Coordination Procedures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-139915

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.