pith. sign in

arxiv: 1211.1909 · v1 · pith:7W5JRAMMnew · submitted 2012-11-08 · 💻 cs.DS · cs.SI· nlin.AO

On the Convergence of the Hegselmann-Krause System

classification 💻 cs.DS cs.SInlin.AO
keywords boundsystemconvergenceagentshegselmann-krausemodeltimearbitrary
0
0 comments X
read the original abstract

We study convergence of the following discrete-time non-linear dynamical system: n agents are located in R^d and at every time step, each moves synchronously to the average location of all agents within a unit distance of it. This popularly studied system was introduced by Krause to model the dynamics of opinion formation and is often referred to as the Hegselmann-Krause model. We prove the first polynomial time bound for the convergence of this system in arbitrary dimensions. This improves on the bound of n^{O(n)} resulting from a more general theorem of Chazelle. Also, we show a quadratic lower bound and improve the upper bound for one-dimensional systems to O(n^3).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.