Abstract
AbstractHegselmann 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 using an integer linear programming approach. (© 2014 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have