# Analysis of a networked social algorithm for collective selection of a committee of representatives

## TL;DR

This paper evaluates a trust-based networked voting algorithm for selecting representative committees, demonstrating high representativeness and robustness, especially for small committees with high integrity, and resilience against strategic manipulation.

## Contribution

It extends prior work by analyzing the trustability and strategic robustness of the networked voting rule in committee selection.

## Key findings

- High representativeness for small, high-integrity committees
- Robustness against strategic and untruthful voting behaviors
- Effective incorporation of individual integrity perceptions

## Abstract

A recent work by Hern\'andez et al. 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. These mechanisms generated a high level of representativeness of the selected committee, weakening the possibility of relations of patronage. By incorporating the integrity of individuals and its perception, here we address the question of the trustability of the resulting committee. Our results show that this voting rule provides high representativeness for small committees with a high level of integrity. Furthermore, the voting system displays robustness to a strategic and untruthful application of the voting algorithm.