Skip to main content

On the convergence of the Hegselmann-Krause system

Author(s): Bhattacharyya, Arnab; Braverman, Mark; Chazelle, Bernard; Nguyen, Huy L.

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1gm41
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhattacharyya, Arnab-
dc.contributor.authorBraverman, Mark-
dc.contributor.authorChazelle, Bernard-
dc.contributor.authorNguyen, Huy L.-
dc.date.accessioned2018-07-20T15:11:04Z-
dc.date.available2018-07-20T15:11:04Z-
dc.date.issued2013-01-09en_US
dc.identifier.citationBhattacharyya, A, Braverman, M, Chazelle, B, Nguyen, HL. (2013). On the convergence of the Hegselmann-Krause system. 61 - 65. doi:10.1145/2422436.2422446en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1gm41-
dc.description.abstractWe study convergence of the following discrete-time non-linear dynamical system: n agents are located in ℝ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 nO(n) resulting from a more general theorem of Chazelle [4]. Also, we show a quadratic lower bound and improve the upper bound for one-dimensional systems to O(n 3)en_US
dc.format.extent61 - 65en_US
dc.language.isoen_USen_US
dc.relation.ispartofITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Scienceen_US
dc.rightsAuthor's manuscripten_US
dc.titleOn the convergence of the Hegselmann-Krause systemen_US
dc.typeConference Articleen_US
dc.identifier.doidoi:10.1145/2422436.2422446-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
On the convergence of the Hegselmann-Krause system.pdf294.43 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.