Abstract
Let $$f_{k}(n)$$fk(n) be the maximum number of time steps taken to reach equilibrium by a system of $$n$$n agents obeying the $$k$$k-dimensional Hegselmann---Krause bounded confidence dynamics. Previously, it was known that $$\varOmega (n) = f_{1}(n) = O(n^3)$$Ω(n)=f1(n)=O(n3). Here we show that $$f_{1}(n) = \varOmega (n^2)$$f1(n)=Ω(n2), which matches the best-known lower bound in all dimensions $$k \ge 2$$k?2.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.