Eliminating Majority Illusion is Easy
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909272851349504 |
|---|---|
| author | Dippel, Jack la Tour, Max Dupré Niu, April Roy, Sanjukta Vetta, Adrian |
| author_facet | Dippel, Jack la Tour, Max Dupré Niu, April Roy, Sanjukta Vetta, Adrian |
| contents | Majority Illusion is a phenomenon in social networks wherein the decision by the majority of the network is not the same as one's personal social circle's majority, leading to an incorrect perception of the majority in a large network. In this paper, we present polynomial-time algorithms which can eliminate majority illusion in a network by altering as few connections as possible. Additionally, we prove that the more general problem of ensuring all neighbourhoods in the network are at least a $p$-fraction of the majority is NP-hard for most values of $p$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_20187 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Eliminating Majority Illusion is Easy Dippel, Jack la Tour, Max Dupré Niu, April Roy, Sanjukta Vetta, Adrian Multiagent Systems Majority Illusion is a phenomenon in social networks wherein the decision by the majority of the network is not the same as one's personal social circle's majority, leading to an incorrect perception of the majority in a large network. In this paper, we present polynomial-time algorithms which can eliminate majority illusion in a network by altering as few connections as possible. Additionally, we prove that the more general problem of ensuring all neighbourhoods in the network are at least a $p$-fraction of the majority is NP-hard for most values of $p$. |
| title | Eliminating Majority Illusion is Easy |
| topic | Multiagent Systems |
| url | https://arxiv.org/abs/2407.20187 |