Related Experiment Video
Updated: Jan 19, 2026

The HoneyComb Paradigm for Research on Collective Human Behavior
Published on: January 19, 2019
Analyzing a networked social algorithm for collective selection of representative committees
Alexis R Hernández1, Carlos Gracia-Lázaro2, Edgardo Brigatti1
1Instituto de Física, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil.
Abstract:
A recent work (Hernández, et al., 2018) introduced a networked voting rule supported by a trust-based social network, where indications of possible representatives were based on individuals opinions. Individual contributions went beyond a simple vote-counting and were based on proxy voting. This mechanism selects committees with high levels of representativeness, weakening the possibility of patronage relations. By incorporating the integrity of individuals and its perception, we here address the question of the resulting committee's trustability. Our results show that this voting rule provides sufficiently small committees with high levels of representativeness and integrity. Furthermore, the voting system displays robustness to strategic and untruthful application of the voting algorithm.
Related Concept Videos
The Representativeness Heuristic
Group Design
Social Proof
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Sampling Plans
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...

