Federated Assemblies
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915176066842624 |
|---|---|
| author | Halpern, Daniel Procaccia, Ariel D. Shapiro, Ehud Talmon, Nimrod |
| author_facet | Halpern, Daniel Procaccia, Ariel D. Shapiro, Ehud Talmon, Nimrod |
| contents | A citizens' assembly is a group of people who are randomly selected to represent a larger population in a deliberation. While this approach has successfully strengthened democracy, it has certain limitations that suggest the need for assemblies to form and associate more organically. In response, we propose federated assemblies, where assemblies are interconnected, and each parent assembly is selected from members of its child assemblies. The main technical challenge is to develop random selection algorithms that meet new representation constraints inherent in this hierarchical structure. We design and analyze several algorithms that provide different representation guarantees under various assumptions on the structure of the underlying graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_19129 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Federated Assemblies Halpern, Daniel Procaccia, Ariel D. Shapiro, Ehud Talmon, Nimrod Computer Science and Game Theory Distributed, Parallel, and Cluster Computing A citizens' assembly is a group of people who are randomly selected to represent a larger population in a deliberation. While this approach has successfully strengthened democracy, it has certain limitations that suggest the need for assemblies to form and associate more organically. In response, we propose federated assemblies, where assemblies are interconnected, and each parent assembly is selected from members of its child assemblies. The main technical challenge is to develop random selection algorithms that meet new representation constraints inherent in this hierarchical structure. We design and analyze several algorithms that provide different representation guarantees under various assumptions on the structure of the underlying graph. |
| title | Federated Assemblies |
| topic | Computer Science and Game Theory Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2405.19129 |