On the convergence of the Hegselmann-Krause system
DOI10.1145/2422436.2422446zbMath1361.68106arXiv1211.1909OpenAlexW2962963506MaRDI QIDQ2986859
Mark Braverman, Huy L. Nguyen, Arnab Bhattacharyya, Bernard Chazelle
Publication date: 16 May 2017
Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.1909
Analysis of algorithms and problem complexity (68Q25) Decentralized systems (93A14) Models of societies, social and urban evolution (91D10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symbolic dynamics (37B10) Applications of difference equations (39A60)
Related Items (18)
Cites Work
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- Occam's razor
- Pseudorandom generators for space-bounded computation
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Recent Developments in Algorithmic Teaching
- A theory of the learnable
- Teaching Randomized Learners
- Algorithmic Learning Theory
- A theory of goal-oriented communication
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the convergence of the Hegselmann-Krause system