Democratic Forking: Choosing Sides with Social Choice
| Authors |
|
|---|---|
| Publication date | 2021 |
| Host editors |
|
| Book title | Algorithmic Decision Theory |
| Book subtitle | 7th International Conference, ADT 2021, Toulouse, France, November 3–5, 2021 : proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | 7th International Conference on Algorithmic Decision Theory, ADT 2021 |
| Pages (from-to) | 341-356 |
| Number of pages | 16 |
| Publisher | Cham: Springer |
| Organisations |
|
| Abstract |
Any community in which membership is voluntary may eventually break apart, or fork. For example, forks may occur in political parties, business partnerships, social groups, and cryptocurrencies. Forking may be the product of informal social processes or the organized action of an aggrieved minority or an oppressive majority. The aim of this paper is to provide a social choice framework in which agents can report preferences not only over a set of alternatives, but also over the possible forks that may occur in the face of disagreement. We study the resulting social choice setting, concentrating on stability issues, preference elicitation and strategy-proofness. |
| Document type | Conference contribution |
| Note | We thank the generous support of the Braginsky Center for the Interface between Science and the Humanities. Nimrod Talmon was supported by the Israel Science Foundation (ISF; Grant No. 630/19). Ben Abramowitz was supported in part by NSF award CCF-1527497. |
| Language | English |
| Published at | https://doi.org/10.1007/978-3-030-87756-9_22 |
| Other links | https://www.scopus.com/pages/publications/85118969671 |
| Downloads |
Abramowitz2021_Chapter_DemocraticForkingChoosingSides
(Final published version)
|
| Permalink to this page | |
