Abstract
Hegselmann and Krause introduced a discrete-time model of opinion dynamics with agents having limit confidence. It is well known that the dynamics reaches a stable state in a polynomial number of time steps. However, the gap between the known lower and upper bounds for the worst case is still immense. In this paper exact values for the maximum time, needed to reach consensus or to discover that consensus is impossible, are determined for small number of agents using an integer linear programming approach.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.